This book discusses two questions in Complexity Theory: the Monotonicity Testing problem and the 2-to-2 Games Conjecture.
Monotonicity testing is a problem from the field of property testing, first considered by Goldreich et al. in 2000. The input of the algorithm is a function, and the goal is to design a tester that makes as few queries to the function as possible, accepts monotone functions and rejects far-from monotone functions with a probability close to 1.
The first result of this book is an essentially optimal algorithm for this problem. The analysis of the algorithm heavily relies on a novel, directed, and robust analogue of a Boolean isoperimetric inequality of Talagrand from 1993.
The probabilistically checkable proofs (PCP) theorem is one of the cornerstones of modern theoretical computer science. One area in which PCPs are essential is the area of hardness of approximation. Therein, the goal is to prove that some optimization problems are hard to solve, even approximately. Many hardness of approximation results were proved using the PCP theorem; however, for some problems optimal results were not obtained. This book touches on some of these problems, and in particular the 2-to-2 games problem and the vertex cover problem.
The second result of this book is a proof of the 2-to-2 games conjecture (with imperfect completeness), which implies new hardness of approximation results for problems such as vertex cover and independent set. It also serves as strong evidence towards the unique games conjecture, a notorious related open problem in theoretical computer science. At the core of the proof is a characterization of small sets of vertices in Grassmann graphs whose edge expansion is bounded away from 1.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
EUR 11,92 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiDa: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 233 pages. 9.21x7.56x2.83 inches. In Stock. This item is printed on demand. Codice articolo __1450399665
Quantità: 2 disponibili
Da: moluna, Greven, Germania
Condizione: New. Über den AutorDor Minzer is an Assistant Professor of Mathematics and Massachusetts Institute of Technology (MIT), working in the areas of theoretical computer science and discrete mathematics. Prior to joining MIT, he rec. Codice articolo 902839164
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9781450399661_new
Quantità: Più di 20 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 191. Codice articolo C9781450399661
Quantità: Più di 20 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. 2022. paperback. . . . . . Codice articolo V9781450399661
Quantità: Più di 20 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 233 pages. 9.21x7.56x2.83 inches. In Stock. Codice articolo x-1450399665
Quantità: 2 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. Neuware - This book discusses two questions in Complexity Theory: the Monotonicity Testing problem and the 2-to-2 Games Conjecture. Codice articolo 9781450399661
Quantità: 2 disponibili
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: New. 2022. paperback. . . . . . Books ship from the US and Ireland. Codice articolo V9781450399661
Quantità: Più di 20 disponibili
Da: Mispah books, Redhill, SURRE, Regno Unito
paperback. Condizione: New. New. book. Codice articolo ERICA82914503996656
Quantità: 1 disponibili