Pages that link to "Item:Q647334"
From MaRDI portal
The following pages link to Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334):
Displaying 5 items.
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- Witnessing functions in bounded arithmetic and search problems (Q4227882) (← links)
- NP search problems in low fragments of bounded arithmetic (Q5294030) (← links)
- Improved witnessing and local improvement principles for second-order bounded arithmetic (Q5410329) (← links)
- Witnessing flows in arithmetic (Q6646013) (← links)