Pages that link to "Item:Q4308607"
From MaRDI portal
The following pages link to An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic (Q4308607):
Displayed 18 items.
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- Nested PLS (Q535153) (← links)
- On the computational complexity of cut-reduction (Q636310) (← links)
- The provably total NP search problems of weak second order bounded arithmetic (Q639650) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- Alternating minima and maxima, Nash equilibria and bounded arithmetic (Q764279) (← links)
- On the complexity of finding falsifying assignments for Herbrand disjunctions (Q892133) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- Ordinal notations and well-orderings in bounded arithmetic (Q1861331) (← links)
- Relating the bounded arithmetic and polynomial time hierarchies (Q1899144) (← links)
- What are the \(\forall \Sigma_ 1^ b\)-consequences of \(T_ 2^ 1\) and \(T_ 2^ 2\)? (Q1899145) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
- Separation results for the size of constant-depth propositional proofs (Q2566064) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- A note on the Σ<sub>1</sub>collection scheme and fragments of bounded arithmetic (Q3552388) (← links)
- A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270) (← links)
- The NP Search Problems of Frege and Extended Frege Proofs (Q5278209) (← links)