[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Dense instances of hard optimization problems
- 作者Mayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika
- 文件大小583.92KB
- 发表时间1998
- DOI10.1007/bfb0053022
- 页码299-311
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || DerandomizationMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Introduction to randomized algorithmsMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Proving the PCP-TheoremMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Dense instances of hard optimization problemsMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Proof checking and non-approximabilityMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Parallel repetition of MIP(2,1) systemsMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998
[Lecture Notes in Computer Science] Lectures on Proof Verification and Approximation Algorithms Volume 1367 || Optimal non-approximability of MaxCliqueMayr, Ernst W.; Jürgen Prömel, Hans; Steger, Angelika · 1998