Anbieter: Brook Bookstore On Demand, Napoli, NA, Italien
EUR 52,47
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: new.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 57,66
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: California Books, Miami, FL, USA
EUR 64,82
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 66,80
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
EUR 60,20
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. 2022. paperback. . . . . .
Anbieter: Brook Bookstore On Demand, Napoli, NA, Italien
EUR 67,27
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: new.
Verlag: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Sprache: Englisch
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 74,97
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 71,48
Währung umrechnenAnzahl: 3 verfügbar
In den WarenkorbZustand: New.
Anbieter: Books Puddle, New York, NY, USA
EUR 76,18
Währung umrechnenAnzahl: 3 verfügbar
In den WarenkorbZustand: New. 1st edition NO-PA16APR2015-KAP.
Verlag: Association of Computing Machinery,U.S., US, 2022
ISBN 10: 1450399665 ISBN 13: 9781450399661
Sprache: Englisch
Anbieter: Rarewaves USA, OSWEGO, IL, USA
EUR 79,73
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback. Zustand: New. 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.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 66,62
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 65,56
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 74,97
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. 2022. paperback. . . . . . Books ship from the US and Ireland.
Verlag: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Sprache: Englisch
Anbieter: California Books, Miami, FL, USA
EUR 86,13
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Verlag: Association of Computing Machinery,U.S., US, 2022
ISBN 10: 1450399665 ISBN 13: 9781450399661
Sprache: Englisch
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
EUR 89,12
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback. Zustand: New. 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.
Verlag: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Sprache: Englisch
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 88,40
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 72,83
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
EUR 77,86
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. 2022. hardcover. . . . . .
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 84,92
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 233 pages. 9.21x7.56x2.83 inches. In Stock.
Verlag: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Sprache: Englisch
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 91,75
Währung umrechnenAnzahl: 3 verfügbar
In den WarenkorbZustand: New.
Verlag: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Sprache: Englisch
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 85,61
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Verlag: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Sprache: Englisch
Anbieter: Books Puddle, New York, NY, USA
EUR 99,02
Währung umrechnenAnzahl: 3 verfügbar
In den WarenkorbZustand: New. 1st edition NO-PA16APR2015-KAP.
Verlag: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Sprache: Englisch
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 84,07
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 97,34
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. 2022. hardcover. . . . . . Books ship from the US and Ireland.
Verlag: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Sprache: Englisch
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 94,78
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Verlag: Association of Computing Machinery,U.S., US, 2022
ISBN 10: 1450399665 ISBN 13: 9781450399661
Sprache: Englisch
Anbieter: Rarewaves USA United, OSWEGO, IL, USA
EUR 81,25
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback. Zustand: New. 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.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 114,07
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 218 pages. 9.50x7.50x0.75 inches. In Stock.
Verlag: Association For Computing Machinery 6504698 Dez 2022, 2022
ISBN 10: 1450399665 ISBN 13: 9781450399661
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 88,04
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbTaschenbuch. Zustand: Neu. Neuware - 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.
Verlag: Association of Computing Machinery,U.S., US, 2022
ISBN 10: 1450399665 ISBN 13: 9781450399661
Sprache: Englisch
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
EUR 83,13
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback. Zustand: New. 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.
Verlag: Association For Computing Machinery 6504698 Dez 2022, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 117,39
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbBuch. Zustand: Neu. Neuware - 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.