The following pages link to Natural Self-Reducible Sets (Q3816974):
Displaying 17 items.
- On quasilinear-time complexity theory (Q672330) (← links)
- Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625) (← links)
- Padding, commitment and self-reducibility (Q808694) (← links)
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
- Bi-immunity results for cheatable sets (Q920981) (← links)
- The complexity of unions of disjoint sets (Q955349) (← links)
- Promise problems complete for complexity classes (Q1109568) (← links)
- Oracles for structural properties: The isomorphism problem and public-key cryptography (Q1190988) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas (Q1262855) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- THE INFORMATIONAL CONTENT OF CANONICAL DISJOINT NP-PAIRS (Q3636159) (← links)
- A survey of one-way functions in complexity theory (Q4009812) (← links)
- Molecular computing, bounded nondeterminism, and efficient recursion (Q4572009) (← links)
- Unions of Disjoint NP-Complete Sets (Q5892145) (← links)
- Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)
