The following pages link to Inverting onto functions. (Q1426007):
Displaying 12 items.
- The shrinking property for NP and coNP (Q627189) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Comparing reductions to NP-complete sets (Q879596) (← links)
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
- Recursion-theoretic ranking and compression (Q1713478) (← links)
- Total nondeterministic Turing machines and a p-optimal proof system for SAT (Q2011675) (← links)
- Closure and nonclosure properties of the classes of compressible and rankable sets (Q2037201) (← links)
- The opacity of backbones (Q2051797) (← links)
- Does the polynomial hierarchy collapse if onto functions are invertible? (Q2268347) (← links)
- ON THE CIRCUIT-SIZE OF INVERSES (Q3224957) (← links)
- NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN (Q5100043) (← links)
- Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)
