scientific article
From MaRDI portal
Publication:3081638
zbMath1244.03163MaRDI QIDQ3081638
Arnold Beckmann, Samuel R. Buss
Publication date: 9 March 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items (8)
Approximate counting and NP search problems ⋮ Mining the surface: witnessing the low complexity theorems of arithmetic ⋮ Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem ⋮ INCOMPLETENESS IN THE FINITE DOMAIN ⋮ Improved witnessing and local improvement principles for second-order bounded arithmetic ⋮ Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) ⋮ Nested PLS ⋮ A Characterisation of Definable NP Search Problems in Peano Arithmetic
This page was built for publication:
