Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

FOCS
2000
IEEE

favoriteEmaildiscussreport

72views Theoretical Computer Science» more FOCS 2000»

Pseudorandom Generators in Propositional Proof Complexity

13 years 9 months ago

Pseudorandom Generators in Propositional Proof Complexity

Download www.math.ias.edu

Michael Alekhnovich, Eli Ben-Sasson, Alexander A.

Real-time Traffic

FOCS 2000 | Theoretical Computer Science |

claim paper

Related Content

» Pseudorandomness for network algorithms

» Linear Complexity versus Pseudorandomness On Beth and Dais Result

» ConstantRound Multiparty Computation Using a BlackBox Pseudorandom Generator

» Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates

» On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity

» Substitutions into propositional tautologies

» AlmostNatural Proofs

» New Directions in InstantiationBased Theorem Proving

» Private Information Retrieval Based on the Subgroup Membership Problem

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	FOCS
Authors	Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson

Comments (0)