Per Austrin

1. New NP-hardness results for 3-Coloring and 2-to-1 Label Cover
   2012/10/20 by Per Austrin, Ryan O’Donnell, Austrin, Per +5 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #Optimization and Search Problems
2. Inapproximability of NP-Complete Variants of Nash Equilibrium
   2011/04/19 by Per Austrin, Austrin, Per, Mark Braverman +3 · 1 citation
   Decision Sciences · Economics, Econometrics and Finance · #Auction Theory and Applications #Computational Complexity (cs.CC) #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Applications #Game Theory and Voting Systems
3. Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
   2011/09/22 by Per Austrin, Austrin, Per, Toniann Pitassi +3 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
4. Space--Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm
   2013/03/04 by Per Austrin, Austrin, Per, Petteri Kaski +5 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Distributed systems and fault tolerance