Pages that link to "Item:Q4575831"
From MaRDI portal
The following pages link to Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q4575831):
Displaying 14 items.
- The complexity of the parity argument with potential (Q2037189) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- Unique end of potential line (Q2194856) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- (Q4989405) (← links)
- ARRIVAL: Next Stop in CLS (Q5002737) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- From Minicrypt to Obfustopia via Private-Key Functional Encryption (Q5738873) (← links)
