登入選單
返回Google圖書搜尋
Lectures on Proof Verification and Approximation Algorithms
Ernst W. MayrHans Jürgen PrömelAngelika Steger
出版Springer Science & Business Media, 1998-02-25
主題Computers / Artificial Intelligence / GeneralComputers / Computer ScienceComputers / Data Science / GeneralComputers / Information TechnologyComputers / Machine TheoryComputers / Programming / AlgorithmsComputers / User InterfacesMathematics / CalculusMathematics / Discrete MathematicsMathematics / LogicMathematics / CombinatoricsMathematics / Functional AnalysisMathematics / Optimization
ISBN35406420139783540642015
URLhttp://books.google.com.hk/books?id=_C8Ly1ya4cgC&hl=&source=gbs_api
EBookSAMPLE
註釋During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofs and aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic.