Pages that link to "Item:Q4009812"

The following pages link to A survey of one-way functions in complexity theory (Q4009812):

Displaying 20 items.

• An observation on associative one-way functions in complexity theory (Q293135) (← links)
• Tight lower bounds on the ambiguity of strong, total, associative, one-way functions (Q596322) (← links)
• Inverse monoids associated with the complexity class NP (Q666698) (← links)
• Strong polynomial-time reducibility (Q676314) (← links)
• Complexity classes of equivalence problems revisited (Q716333) (← links)
• A note on quadratic residuosity and UP (Q834917) (← links)
• Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
• One-way permutations, computational asymmetry and distortion. (Q959774) (← links)
• Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
• A hierarchy based on output multiplicity (Q1274991) (← links)
• Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
• Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory (Q1307703) (← links)
• A taxonomy of complexity classes of functions (Q1329166) (← links)
• The isomorphism conjecture holds and one-way functions exist relative to an oracle (Q1362333) (← links)
• Characterizing the existence of one-way permutations (Q1575721) (← links)
• On characterizing the existence of partial one-way permutations (Q1603545) (← links)
• One-way permutations and self-witnessing languages (Q1877694) (← links)
• If P \(\neq\) NP then some strongly noninvertible functions are invertible (Q2508963) (← links)
• Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
• NP-Creative sets: A new class of creative sets in NP (Q4895816) (← links)