Concepedia

Per Austrin

PA

Statistics

Publications

18

Citations

1.9K

H-Index

15

Active since

2007

Affiliations

KTH Royal Institute of Technology(Current)

Aalto University

University of Toronto

University of California, Berkeley

University of Waterloo

Per Austrin is an author at KTH Royal Institute of Technology specializing in algorithms, mathematics, and computer science.

Publications per year

2007–2017

18

Publications

18

Towards Sharp Inapproximability For Any 2-CSP

Per Austrin · 2007 · 1.4K citations

, , +17

Approximation Resistant Predicates from Pairwise Independence

Per Austrin, Elchanan Mossel · Computational Complexity · 2009 · 93 citations

, , +9

Inapproximability of Treewidth and Related Problems

Yuhuai Wu, Per Austrin, Toniann Pitassi et al. · Journal of Artificial Intelligence Research · 2014 · 64 citations · Full text

, , +16

Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

Per Austrin, Subhash Khot, Muli Safra · 2009 · 62 citations

, , +10

$(2+\varepsilon)$-Sat Is NP-hard

Per Austrin, Venkatesan Guruswami, Johan Håstad · SIAM Journal on Computing · 2017 · 52 citations

, , +13

1–5 of 18