Abstract
We give combinatorial and computational characterizations of the NP search problems definable in the bounded arithmetic theories T$^2_2$ T$^3_2$.
Citation
Jan Krajíček. Alan Skelley. Neil Thapen. "NP search problems in low fragments of bounded arithmetic." J. Symbolic Logic 72 (2) 649 - 672, June 2007. https://doi.org/10.2178/jsl/1185803628
Information
