Pages that link to "Item:Q5212850"
From MaRDI portal
The following pages link to Finding a Nash equilibrium is no easier than breaking Fiat-Shamir (Q5212850):
Displaying 11 items.
- 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)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- (Q5092469) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- On the Complexity of Equilibrium Computation in First-Price Auctions (Q5885597) (← links)
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266) (← links)
