MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The Complexity of Propositional Proofs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

42 documents found, showing 1 through 10. Next 10 →

ATOM

The complexity of propositional proofs
by Nathan Segerlind — Bulletin of Symbolic Logic
…THE COMPLEXITY OF PROPOSITIONAL PROOFS NATHAN SEGERLIND Abstract. Propositional proof complexity…
Cited by 1 (0 self) – Add To MetaCart

On the Complexity of Propositional Proof Systems
by Nicola Galesi, Advisor Prof, Maria Luisa Bonet, Departament Llenguatges — 2000
…On the Complexity of Propositional Proof Systems Nicola Galesi e-mail: galesi@ lsi.upc.es Advisor…
Cited by 2 (0 self) – Add To MetaCart

The Complexity Of Propositional Proofs
by Alasdair Urquhart — 1995 — Bulletin of Symbolic Logic
… is the proof theory of bounded arithmetic and its relation to the complexity of propositional proofs…
Cited by 80 (1 self) – Add To MetaCart

Publications
by Russell Impagliazzo, Avner Magen, Toniann Pitassi
…, computational complexity, propositional proof complexity, derandomization. Education * Ph.D.: Computer Science…
Add To MetaCart

Pseudorandom Generators in Propositional Proof Complexity
by Michael Alekhnovich, Eli Ben-Sasson Alexander A. Razborov, Eli Ben-sasson, Alexander A. Razborov, Avi Wigderson — 2000 — Electronic Colloquium on Computational Complexity, Rep. No.23
…Pseudorandom Generators in Propositional Proof Complexity Michael Alekhnovich , Eli Ben…
Cited by 30 (4 self) – Add To MetaCart

A type system for certified binaries
by Zhong Shao, Valery Trifonov, Bratin Saha, Nikolaos Papaspyrou — 2002 — In ACM Symposium on Principles of Programming Languages
… general framework for explicitly representing complex propositions and proofs in typed intermediate…
Cited by 68 (10 self) – Add To MetaCart

Machine-Independent Evaluation of Theorem-Proving Strategies
by Maria Paola Bonacina — 1997
… of propositional proofs as part of the quest for NP 6= co\GammaN P (e.g., see [10] for a survey), or works…
Cited by 1 (1 self) – Add To MetaCart

On an optimal quantified propositional proof system and a complete language for NP . . .
by Zenon Sadowski — 1997 — In Proceedings of the 11th International Symposium on Fundamentals of Computing Theory, LNCS #1279
…-NP. 1 Introduction There is a lot of activity around the complexity of propositional proof systems (see…
Cited by 3 (0 self) – Add To MetaCart

Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic
by Alexander A. Razborov — 1996 — Proceedings of the 23rd ICALP, Lecture Notes in Computer Science
… on the complexity of proofs in various propositional proof systems, paying special attention to recent attempts…
Cited by 24 (10 self) – Add To MetaCart

Space Complexity in Propositional Calculus
by Michael Alekhnovich, Eli Ben-sasson, Alexander A. Razborov, Avi Wigderson — 2002
…. Introduction. Complexity of propositional proofs plays as important a role in the theory of feasible proofs…
Cited by 25 (6 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB