Pages that link to "Item:Q1171050"
From MaRDI portal
The following pages link to An arithmetical characterization of NP (Q1171050):
Displayed 13 items.
- Circuit lower bounds in bounded arithmetics (Q466447) (← links)
- \(\text{NP}\not={co}\)-NP and models of arithmetic (Q672454) (← links)
- A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets (Q790804) (← links)
- Polynomial time computations in models of ET (Q795035) (← links)
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly (Q937909) (← links)
- Uniform normal form for general time-bounded complexity classes (Q1087539) (← links)
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
- Recursion theoretic characterizations of complexity classes of counting functions (Q1365942) (← links)
- Metafinite model theory (Q1383163) (← links)
- Multifunction algebras and the provability of \(PH\downarrow\) (Q1577486) (← links)
- Arithmetical definability and computational complexity (Q1885035) (← links)
- A theory for Log-Space and NLIN versus co-NLIN (Q4650271) (← links)
- Metafinite model theory (Q6064289) (← links)