Semialgebraic proofs and efficient algorithm design
著者
書誌事項
Semialgebraic proofs and efficient algorithm design
（Foundations and trends in theoretical computer science, 14:1-2）
now Publishers, c2019
- : pbk
大学図書館所蔵 件 / 全1件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references(p. 209-223)
内容説明・目次
内容説明
In the last two decades a link has been established that, in some cases, proof that a solution exists has enabled an algorithm to find that solution itself. This has had most effect on semialgebraic proof systems and linear and semidefinite programming.This monograph details the interplay between proof systems and efficient algorithm design and surveys the state-of-the-art for two of the most important semi-algebraic proof systems: Sherali-Adams and Sum-of-Squares. It provides the readers with a rigorous treatment of these systems both as proof systems, and as a general family of optimization algorithms. The emphasis is on illustrating the main ideas by presenting a small fraction of representative results with detailed intuition and commentary. The monograph is self-contained and includes a review of the necessary mathematical background including basic theory of linear and semidefinite programming.
Semialgebraic Proofs and Efficient Algorithm Design provides the advanced reader with a deep insight into the exciting line of research. It will inspire readers in deploying the techniques in their own further research.
目次
1. Introduction
2. Sherali-Adams
3. Sum-of-Squares
4. Upper Bounds via Sum-of-Squares
5. Lower Bounds for Sum-of-Squares
References
「Nielsen BookData」 より