logo
http://theoryofcomputing.org     ISSN 1557-2862
Endorsed by ACM SIGACT
  • Home
  • Introduction
  • Articles
  • Special Issues
  • Library
  • Editors
  • Submit
  • Issues
  • Contact Us
  • Search
Articles by Per Austrin
Vol 9, Article 3 (pp 117-142)
Inapproximability of NP-Complete Variants of Nash Equilibrium
by Per Austrin, Mark Braverman, and Eden Chlamtáč
Vol 7, Article 3 (pp 27-43)
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
by Per Austrin, Subhash Khot, and Muli Safra