Pages that link to "Item:Q2639055"

The following pages link to One-way functions and the nonisomorphism of NP-complete sets (Q2639055):

Displaying 20 items.

• Relativized isomorphisms of NP-complete sets (Q687510) (← links)
• Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
• On sets polynomially enumerable by iteration (Q1176233) (← links)
• Separating complexity classes with tally oracles (Q1185002) (← links)
• The relative complexity of NP search problems (Q1273858) (← links)
• Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159) (← links)
• The isomorphism conjecture holds and one-way functions exist relative to an oracle (Q1362333) (← links)
• A tight relationship between generic oracles and type-2 complexity theory (Q1369098) (← links)
• An oracle builder's toolkit (Q1398366) (← links)
• Non-uniform reductions (Q1959376) (← links)
• Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
• Collapsing degrees via strong computation (Q2366690) (← links)
• LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
• Time and space complexity of deterministic and nondeterministic decision trees (Q2679423) (← links)
• UP and the low and high hierarchies: A relativized separation (Q4895813) (← links)
• NP-Creative sets: A new class of creative sets in NP (Q4895816) (← links)
• Promise problems and access to unambiguous computation (Q5096827) (← links)
• A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
• On the power of parity polynomial time (Q5750401) (← links)
• On (simple) decision tree rank (Q6050134) (← links)