Pages that link to "Item:Q1162811"

The following pages link to On the structure of sets in NP and other complexity classes (Q1162811):

Displaying 28 items.

• On the structure of \(\Delta_ 2\!^ p\) (Q789386) (← links)
• Polynomial time computations in models of ET (Q795035) (← links)
• Minimal pairs for P (Q795830) (← links)
• Honest polynomial time reducibilities and the \(P=?NP\) problem (Q909455) (← links)
• The recursion-theoretic structure of complexity classes (Q1064320) (← links)
• Independence results about context-free languages and lower bounds (Q1071500) (← links)
• Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets (Q1075319) (← links)
• Diagonalizations over polynomial time computable sets (Q1107526) (← links)
• On the relative complexity of hard problems for complexity classes without complete problems (Q1112017) (← links)
• A note on structure and looking back applied to the relative complexity of computable functions (Q1158964) (← links)
• On the structure of sets in NP and other complexity classes (Q1162811) (← links)
• A uniform approach to obtain diagonal sets in complexity classes (Q1164414) (← links)
• Reductions on NP and p-selective sets (Q1166515) (← links)
• The complexity types of computable sets (Q1190982) (← links)
• The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory (Q1193873) (← links)
• Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
• Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
• The structure of the honest polynomial m-degrees (Q1341316) (← links)
• Index sets and presentations of complexity classes (Q1366536) (← links)
• Undecidability results for low complexity time classes (Q1567411) (← links)
• Structural properties of bounded relations with an application to NP optimization problems (Q1589424) (← links)
• On an optimal propositional proof system and the structure of easy subsets of TAUT. (Q1853507) (← links)
• Uniformly hard languages. (Q1874273) (← links)
• Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
• A complexity theory for feasible closure properties (Q2366687) (← links)
• Generality's price: Inescapable deficiencies in machine-learned programs (Q2368918) (← links)
• On Complete Problems, Relativizations and Logics for Complexity Classes (Q3586004) (← links)
• The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783) (← links)