Pages that link to "Item:Q3137488"
From MaRDI portal
The following pages link to Fragments of Bounded Arithmetic and Bounded Query Classes (Q3137488):
Displaying 8 items.
- On the computational complexity of cut-reduction (Q636310) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- Relating the bounded arithmetic and polynomial time hierarchies (Q1899144) (← links)
- Induction rules in bounded arithmetic (Q2309507) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
- Bounded theories for polyspace computability (Q2450770) (← links)
- A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270) (← links)
