Mathematical theory of computation

Thema UYA

259 tuit · page 1/7
ETH False II: completing the proof
Formal & Physical Sciences Computing & Cybersecurity
EN

ETH False II: completing the proof

Ryan O'Donnell
82 min
★ ★ ★ ★ ★ 5/5
Computational ComplexityETHPermanent
How to construct random strings
Formal & Physical Sciences Computing & Cybersecurity
EN

How to construct random strings

Rahul Santhanam
44 min
★ ★ ★ ★ ☆ 4/5
Pseudorandom GeneratorsDerandomizationComplexity Theory
Extractors for samplable sources
Formal & Physical Sciences Computing & Cybersecurity
EN

Extractors for samplable sources

Ronen Shaltiel
69 min
★ ★ ★ ★ ☆ 4/5
Randomness ExtractorsDerandomizationComplexity Theory
Ján Pich | Efficient Adversaries
Formal & Physical Sciences Computing & Cybersecurity
EN

Ján Pich | Efficient Adversaries

Ján Pich
38 min
★ ★ ★ ★ ☆ 4/5
Proof ComplexityComputational ComplexityAdversaries