Pages that link to "Item:Q1064780"

The following pages link to On some natural complete operators (Q1064780):

Displaying 25 items.

• Tight lower bounds on the ambiguity of strong, total, associative, one-way functions (Q596322) (← links)
• A note on quadratic residuosity and UP (Q834917) (← links)
• Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
• Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
• Continuous optimization problems and a polynomial hierarchy of real functions (Q1086557) (← links)
• Honest polynomial degrees and \(P=?NP\) (Q1094875) (← links)
• On hardness of one-way functions (Q1097693) (← links)
• On one-way functions and polynomial-time isomorphisms (Q1097694) (← links)
• Some observations on the connection between counting and recursion (Q1098837) (← 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)
• Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory (Q1307703) (← links)
• A tight relationship between generic oracles and type-2 complexity theory (Q1369098) (← links)
• One-way permutations and self-witnessing languages (Q1877694) (← links)
• The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
• On continuous one-way functions (Q2220825) (← links)
• If P \(\neq\) NP then some strongly noninvertible functions are invertible (Q2508963) (← links)
• (Q2913817) (← links)
• On intractability of the classUP (Q3201755) (← links)
• In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
• A survey of one-way functions in complexity theory (Q4009812) (← links)
• Complexity of Operators on Compact Sets (Q4918033) (← links)
• Promise problems and access to unambiguous computation (Q5096827) (← links)
• Every polynomial-time 1-degree collapses if and only if P = PSPACE (Q5311749) (← links)
• Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)