Finding a Nash equilibrium is no easier than breaking Fiat-Shamir

Research article (Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019) · cited 42× · AI/ML
Press Enter · cited answer in seconds

Finding a Nash equilibrium is no easier than breaking Fiat-Shamir

Summary

Finding a Nash equilibrium is no easier than breaking Fiat-Shamir is a scholarly article[1].

Key Facts

  • Finding a Nash equilibrium is no easier than breaking Fiat-Shamir's instance of is recorded as scholarly article[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Retrieved May 24, 2026, from https://4ort.xyz/entity/finding-a-nash-equilibrium-is-no-easier-than-breaking-fiat-shamir
MLA “Finding a Nash equilibrium is no easier than breaking Fiat-Shamir.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/finding-a-nash-equilibrium-is-no-easier-than-breaking-fiat-shamir.
BibTeX @misc{4ortxyz_finding-a-nash-equilibrium-is-no-easier-than-breaking-fiat-shamir_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Finding a Nash equilibrium is no easier than breaking Fiat-Shamir}}, year = {2026}, url = {https://4ort.xyz/entity/finding-a-nash-equilibrium-is-no-easier-than-breaking-fiat-shamir}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Finding a Nash equilibrium is no easier than breaking Fiat-Shamir — https://4ort.xyz/entity/finding-a-nash-equilibrium-is-no-easier-than-breaking-fiat-shamir (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/finding-a-nash-equilibrium-is-no-easier-than-breaking-fiat-shamir · Last refreshed: