Aarhus University Seal / Aarhus Universitets segl

Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review


Original languageEnglish
JournalElectronic Colloquium on Computational Complexity
IssueTR12-25
Number of pages22
ISSN1433-8092
Publication statusPublished - 2012

See relations at Aarhus University Citationformats

ID: 44889163