We give combinatorial and computational characterizations of the NP search problems definable in the bounded arithmetic theories and .
No takes yet. Share an insight, caveat, or question.
Krajı́ček et al. (2007) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: