scientific article; zbMATH DE number 2102736
From MaRDI portal
Publication:4818823
zbMath1045.03524MaRDI QIDQ4818823
Publication date: 24 September 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
First-order arithmetic and fragments (03F30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items (7)
Resolution lower bounds for perfect matching principles ⋮ Resolution lower bounds for the weak functional pigeonhole principle. ⋮ Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution ⋮ Partially definable forcing and bounded arithmetic ⋮ Natural proofs ⋮ The complexity of the Hajós calculus for planar graphs ⋮ On the correspondence between arithmetic theories and propositional proof systems – a survey
This page was built for publication:
