Sciweavers

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

7

APAL
2005

favoriteEmaildiscussreport

62views more APAL 2005»

Separation results for the size of constant-depth propositional proofs

13 years 10 months ago

Separation results for the size of constant-depth propositional proofs

Download math.ucsd.edu

Arnold Beckmann, Samuel R. Buss

Real-time Traffic

APAL 2005 |

claim paper

Related Content

» A note on propositional proof complexity of some Ramseytype statements

» On meta complexity of propositional formulas and propositional proofs

» Parameterized Proof Complexity a Complexity Gap for Parameterized Treelike Resolution

» Parameterized Proof Complexity

» Complexity of Propositional Proofs Under a Promise

» On extracting computations from propositional proofs a survey

» Separating DAGLike and TreeLike Proof Systems

» Zeroknowledge from secure multiparty computation

» Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	APAL
Authors	Arnold Beckmann, Samuel R. Buss

Comments (0)