Pages that link to "Item:Q2104236"
From MaRDI portal
The following pages link to Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236):
Displaying 3 items.
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme (Q6086333) (← links)
