71 search results - page 6 / 15 » Resolution Proofs, Exponential Bounds, and Kolmogorov Comple... |
JCSS
2008
13 years 8 months ago
2008
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
COCO
1994
Springer
14 years 20 days ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
APAL
2008
13 years 8 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
STOC
2010
ACM
14 years 6 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
JACM
2002
13 years 8 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...