Articles by Per Austrin
|
Vol 18, Article 16 (pp 1-54)
Tensor Network Complexity of Multilinear Maps by Per Austrin, Petteri Kaski, and Kaie Kubjas |
|
Vol 11, Article 10 (pp 257-283)
[APRX-RND13 Spec Issue]
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems by Per Austrin, Rajsekar Manokaran, and Cenny Wenner |
|
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 |