Theory & AlgorithmsAlgorithms for Circuits and Circuits for AlgorithmsRyan WilliamsTheory & AlgorithmsAlgorithms for Circuits and Circuits for AlgorithmsRyan WilliamsSupplied bibliography entry.Read now
Theory & AlgorithmsLower Bounds on the Size of Bounded Depth CircuitsAlexander RazborovTheory & AlgorithmsLower Bounds on the Size of Bounded Depth CircuitsAlexander RazborovSupplied bibliography entry.Read now
Theory & AlgorithmsAlgebraic Methods in the Theory of Lower BoundsPaul SmolenskyTheory & AlgorithmsAlgebraic Methods in the Theory of Lower BoundsPaul SmolenskySupplied bibliography entry.Read now
Theory & AlgorithmsAlmost Optimal Lower Bounds for Small Depth CircuitsJohan HåstadTheory & AlgorithmsAlmost Optimal Lower Bounds for Small Depth CircuitsJohan HåstadSupplied bibliography entry.Read now
Theory & Algorithms* Separation of Multilinear Circuit and Formula Size*Ran RazTheory & Algorithms* Separation of Multilinear Circuit and Formula Size*Ran RazSupplied bibliography entry.Read now
Theory & AlgorithmsHardness vs. RandomnessNoam Nisan & Avi WigdersonTheory & AlgorithmsHardness vs. RandomnessNoam Nisan & Avi WigdersonSupplied bibliography entry.Read now
Theory & AlgorithmsP = BPP if E Requires Exponential CircuitsRussell Impagliazzo & Avi WigdersonTheory & AlgorithmsP = BPP if E Requires Exponential CircuitsRussell Impagliazzo & Avi WigdersonSupplied bibliography entry.Read now
Theory & AlgorithmsUndirected Connectivity in Log-SpaceOmer ReingoldTheory & AlgorithmsUndirected Connectivity in Log-SpaceOmer ReingoldSupplied bibliography entry.Read now
Theory & AlgorithmsThe PCP Theorem by Gap AmplificationIrit DinurTheory & AlgorithmsThe PCP Theorem by Gap AmplificationIrit DinurSupplied bibliography entry.Read now
Theory & AlgorithmsProbabilistic Checking of ProofsSanjeev Arora & Shmuel SafraTheory & AlgorithmsProbabilistic Checking of ProofsSanjeev Arora & Shmuel SafraSupplied bibliography entry.Read now
Theory & AlgorithmsProof Verification and the Hardness of Approximation ProblemsSanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario SzegedyTheory & AlgorithmsProof Verification and the Hardness of Approximation ProblemsSanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario SzegedySupplied bibliography entry.Read now
Theory & AlgorithmsApproximating Clique is Almost NP-CompleteUriel Feige et al.Theory & AlgorithmsApproximating Clique is Almost NP-CompleteUriel Feige et al.Supplied bibliography entry.Read now