Pages that link to "Item:Q4085242"

The following pages link to On the Structure of Polynomial Time Reducibility (Q4085242):

Displaying 50 items.

• Strong nondeterministic polynomial-time reducibilities (Q1055405) (← links)
• Qualitative relativizations of complexity classes (Q1061119) (← 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)
• Reductions among polynomial isomorphism types (Q1077412) (← links)
• Some remarks on witness functions for nonpolynomial and noncomplete sets in NP (Q1079364) (← links)
• Honest polynomial degrees and \(P=?NP\) (Q1094875) (← links)
• A note on complete problems for complexity classes (Q1097029) (← links)
• On simple and creative sets in NP (Q1099614) (← links)
• Diagonalizations over polynomial time computable sets (Q1107526) (← links)
• On the relative complexity of hard problems for complexity classes without complete problems (Q1112017) (← links)
• Graph isomorphism is in the low hierarchy (Q1116696) (← links)
• Indexings of subrecursive classes (Q1140080) (← links)
• Discrete extremal problems (Q1152306) (← links)
• A note on structure and looking back applied to the relative complexity of computable functions (Q1158964) (← links)
• The maximum value problem and NP real numbers (Q1161742) (← 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)
• On sparse sets in NP-P (Q1172386) (← links)
• An appraisal of computational complexity for operations researchers (Q1173532) (← links)
• The complexity types of computable sets (Q1190982) (← links)
• On the theory of average case complexity (Q1190984) (← links)
• The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory (Q1193873) (← links)
• A uniform approach to define complexity classes (Q1200807) (← links)
• Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
• Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
• A comparison of polynomial time reducibilities (Q1223166) (← links)
• Polynomial and abstract subrecursive classes (Q1227276) (← links)
• Minimal pairs of polynomial degrees with subexponential complexity (Q1228203) (← links)
• Log space machines with multiple oracle tapes (Q1242686) (← links)
• On polynomial time isomorphisms of some new complete sets (Q1245571) (← links)
• On languages specified by relative acceptance (Q1249438) (← links)
• On splitting recursive sets (Q1251652) (← links)
• Complexity in mechanized hypothesis formation (Q1256867) (← links)
• Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
• On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets (Q1314385) (← links)
• Minimal pairs and complete problems (Q1334663) (← links)
• On problems with short certificates (Q1338895) (← links)
• The structure of the honest polynomial m-degrees (Q1341316) (← links)
• Time bounded frequency computations (Q1383147) (← links)
• Gap-languages and log-time complexity classes (Q1389651) (← links)
• (2+\(f\)(\(n\)))-SAT and its properties. (Q1421480) (← links)
• Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
• Undecidability results for low complexity time classes (Q1567411) (← links)
• Structural properties of bounded relations with an application to NP optimization problems (Q1589424) (← links)
• Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
• On relationships between complexity classes of Turing machines (Q1682916) (← links)
• Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem (Q1782048) (← links)
• Subcomplete generalizations of graph isomorphism (Q1838044) (← links)