Filters
PROOF COMPLEXITY
an encyclopedia of propositional proof complexity. Propositional proof complexity (or, simply, proof complexity) is one of the research areas tightly connecting mathematical logic and computation...
Pure mathematics
- 2019 •
- B
Rok uplatnění
B - Odborná kniha
Proof complexity
This note exposes few basic points of proof complexity in a way accessible to any mathematician...
BA - Obecná matematika
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
Dehn function and length of proofs.
We link the Dehn function of finitely presented groups to the length-of-proofsfunction in propositional proof complexity.
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On the proof complexity of the Nisan-Wigderson generator
We prove the consistency of a statement generalizing Razborov''s conjecture from proof complexity with the true universal theory in the language of Cook''s theory PV....
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Diagonalization in proof complexity
We prove that (i) either there is a language in E requiring exponential circuit complexity, or (ii) the class NP is not closed under the complementation, or (iii) there is no p-optimal propositional proof system....
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Twelve Problems in Proof Complexity
We illustrate the state of art in proof complexity using twelve problems...
BA - Obecná matematika
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
Why are proof complexity lower bounds hard?
to showing lower bounds on propositional proof complexity. We establish the following unconditional result: Propositional proof systems cannot efficiently show that truth tables-Rudich 'natural proofs' barrier hol...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
On the proof complexity of the Nisan-Wigderson generator based on a hard NP boolean AND coNP function
We prove the consistency of a statement generalizing Razborov's conjecture from proof complexity with the true universal theory in the language of Cook's theory PV....
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Proof Complexity of the Cut-free Calculus of Structures
We investigate the proof complexity of analytic subsystems of the deep inference proof system SKSg (the calculus of structures). Exploiting the fact the same complexity as the monotone Gentzen calculus MLK. In part...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
String rewriting and proof complexity: an interpretation of resolution
We interpret the well-known propositional proof system Resolution using string rewriting systems Sigma(n)* and Sigma(n) corresponding to tree-like proofs(a) and sequence-like proofs, respectively. We give a representation o...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 63 057