Pages that link to "Item:Q3159414"
From MaRDI portal
The following pages link to Herbrandizing search problems in Bounded Arithmetic (Q3159414):
Displaying 12 items.
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) (Q535152) (← links)
- A note on propositional proof complexity of some Ramsey-type statements (Q627444) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- On the complexity of finding falsifying assignments for Herbrand disjunctions (Q892133) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Witnessing functions in bounded arithmetic and search problems (Q4227882) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
- Tight bounds for blind search on the integers (Q4910723) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
- NP search problems in low fragments of bounded arithmetic (Q5294030) (← links)
- Fragments of bounded arithmetic and the lengths of proofs (Q5502825) (← links)