scientific article; zbMATH DE number 910748

MaRDI QIDQ4885910zbMATH OpenFDO

Authors Jan Krajíček

Publication date 19 March 1997

zbMATH Keywords

efficiencybounded arithmeticsatisfiabilitypropositional formulaP=NP-problem

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• scientific article; zbMATH DE number 1860672
• The Complexity of Propositional Proofs
• The Complexity of Propositional Proofs
• scientific article; zbMATH DE number 1179974

Cited in

(1)

• Proof complexity in algebraic systems and bounded depth Frege systems with modular counting

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885910)