Proof complexity

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)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2017
0102019702017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
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
We obtain two results about the proof complexity of deep inference: (1) Deep-inference proof systems are as powerful as Frege… (More)
  • figure 1
  • figure 4
Is this relevant?
2009
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
Applications of Games to Propositional Proof Complexity Alexander Hertel Doctor of Philosophy Graduate Department of Computer… (More)
  • figure 2.1
  • figure 2.2
  • figure 4.1
  • figure 4.2
  • figure 4.3
Is this relevant?
2007
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable… (More)
  • figure 1
  • figure 4
Is this relevant?
2006
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
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
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
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?