Computational Characteristics of Random Field Ising Model with Long-Range Interaction
Preprint in arXiv (May 2022)
Lectures on Proof Verification and Approximation Algorithms
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Introduction to the theory of complexity and approximation algorithms
-
Altmetric BadgeChapter 2 Introduction to randomized algorithms
-
Altmetric BadgeChapter 3 Derandomization
-
Altmetric BadgeChapter 4 Proof checking and non-approximability
-
Altmetric BadgeChapter 5 Proving the PCP-Theorem
-
Altmetric BadgeChapter 6 Parallel repetition of MIP(2,1) systems
-
Altmetric BadgeChapter 7 Bounds for approximating MaxLinEq3-2 and MaxEkSat
-
Altmetric BadgeChapter 8 Deriving non-approximability results by reductions
-
Altmetric BadgeChapter 9 Optimal non-approximability of MaxClique
-
Altmetric BadgeChapter 10 The hardness of approximating set cover
-
Altmetric BadgeChapter 11 Semidefinite programming and its applications to approximation algorithms
-
Altmetric BadgeChapter 12 Dense instances of hard optimization problems
-
Altmetric BadgeChapter 13 Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces
Attention for Chapter 13:
Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces