Pages that link to "Item:Q3611786"

The following pages link to Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms (Q3611786):

Displaying 11 items.

• A dichotomy for local small-bias generators (Q315550) (← links)
• On the security of Goldreich's one-way function (Q430847) (← links)
• On linear-size pseudorandom generators and hardcore functions (Q744085) (← links)
• Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms (Q1678752) (← links)
• Input locality and hardness amplification (Q1946597) (← links)
• The complexity of inverting explicit Goldreich's function by DPLL algorithms (Q1946844) (← links)
• Locally computable UOWHF with linear shrinkage (Q2408584) (← links)
• Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
• The Complexity of Inversion of Explicit Goldreich’s Function by DPLL Algorithms (Q3007623) (← links)
• Candidate One-Way Functions Based on Expander Graphs (Q3088178) (← links)
• Indistinguishability obfuscation (Q6198645) (← links)