Sprache: Englisch
Verlag: Association for Computing Machinery 6504698, 2022
ISBN 10: 1450399665 ISBN 13: 9781450399661
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 57,33
Anzahl: 15 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 69,99
Anzahl: 3 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Association for Computing Machinery 6504698, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 73,47
Anzahl: 15 verfügbar
In den WarenkorbHRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. 2022. paperback. . . . . . Books ship from the US and Ireland.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 73,58
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 84,40
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 233 pages. 9.21x7.56x2.83 inches. In Stock.
Sprache: Englisch
Verlag: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 91,49
Anzahl: 3 verfügbar
In den WarenkorbZustand: New.
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. 2022. hardcover. . . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 95,32
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 113,36
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 218 pages. 9.50x7.50x0.75 inches. In Stock.
EUR 73,70
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: 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.
EUR 94,25
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: 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.
Sprache: Englisch
Verlag: Association For Computing Machinery 6504698 Dez 2022, 2022
ISBN 10: 1450399665 ISBN 13: 9781450399661
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Neuware - 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.
Sprache: Englisch
Verlag: Association For Computing Machinery 6504698 Dez 2022, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Neuware - 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.