In computer science, proof complexity is a measure of efficiency of automated theorem proving methods that is based on the size of the proofs theyâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Ryan O'Donnell, Yuan Zhou
- SODA
- 2013

This work is concerned with the proof-complexity of certifying that optimization problems do not have good solutionsâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Paola Bruscoli, Alessio Guglielmi
- ACM Trans. Comput. Log.
- 2009

We obtain two results about the proof complexity of deep inference: (1) Deep-inference proof systems are as powerful as Fregeâ€¦Â (More)

Is this relevant?

2009

2009

- Paul Beame, Trinh Huynh, Toniann Pitassi
- STOC
- 2009

We present a general method for converting any family of unsatisfiable CNF formulas that is hard for one of the simplest proofâ€¦Â (More)

Is this relevant?

2008

2008

- Alexander Hertel
- 2008

Applications of Games to Propositional Proof Complexity Alexander Hertel Doctor of Philosophy Graduate Department of Computerâ€¦Â (More)

Is this relevant?

2007

2007

- Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
- computational complexity
- 2007

We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractableâ€¦Â (More)

Is this relevant?

2006

2006

- Sergei N. ArtÃ«mov, Roman Kuznets
- CSL
- 2006

The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic featureâ€¦Â (More)

Is this relevant?

2002

2002

- Michael Soltys, Stephen A. Cook
- LICS
- 2002

We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the conceptsâ€¦Â (More)

Is this relevant?

2002

2002

- Eli Ben-Sasson, Yonatan Bilu
- Electronic Colloquium on Computational Complexity
- 2002

We present the first example of a natural distribution on instances of an NP-complete problem, with the following propertiesâ€¦Â (More)

Is this relevant?

2001

2001

- Dimitris Achlioptas, Paul Beame, Michael Molloy
- STOC
- 2001

We give the first example of a sharp threshold in proof complexity. More precisely, we show that for any sufficiently smallâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

We call a pseudorandom generator Gn : {0, 1}n â†’ {0, 1}m hard for a propositional proof system P if P can not efficiently proveâ€¦Â (More)

Is this relevant?