Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
EUR 52,47
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : new.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 57,48
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Best Price, Torrance, CA, Etats-Unis
EUR 52,17
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. SUPER FAST SHIPPING.
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 63,58
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 65,53
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
EUR 60,10
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. 2022. paperback. . . . . .
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
EUR 67,27
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : new.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 68,70
Autre deviseQuantité disponible : 3 disponible(s)
Ajouter au panierEtat : New.
Edité par Association for Computing Machinery, 2022
ISBN 10 : 1450399681 ISBN 13 : 9781450399685
Langue: anglais
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 74,72
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Association for Computing Machinery, 2022
ISBN 10 : 1450399681 ISBN 13 : 9781450399685
Langue: anglais
Vendeur : Best Price, Torrance, CA, Etats-Unis
EUR 69,42
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. SUPER FAST SHIPPING.
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 74,34
Autre deviseQuantité disponible : 3 disponible(s)
Ajouter au panierEtat : New. 1st edition NO-PA16APR2015-KAP.
Edité par Association of Computing Machinery,U.S., US, 2022
ISBN 10 : 1450399665 ISBN 13 : 9781450399661
Langue: anglais
Vendeur : Rarewaves USA, OSWEGO, IL, Etats-Unis
EUR 78,21
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback. Etat : 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.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 66,64
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
EUR 73,40
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. 2022. paperback. . . . . . Books ship from the US and Ireland.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 65,58
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Association for Computing Machinery, 2022
ISBN 10 : 1450399681 ISBN 13 : 9781450399685
Langue: anglais
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 84,49
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Association of Computing Machinery,U.S., US, 2022
ISBN 10 : 1450399665 ISBN 13 : 9781450399661
Langue: anglais
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
EUR 88,75
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback. Etat : 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.
Edité par Association for Computing Machinery, 2022
ISBN 10 : 1450399681 ISBN 13 : 9781450399685
Langue: anglais
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 86,71
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 71,47
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
EUR 77,73
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. 2022. hardcover. . . . . .
Edité par Association for Computing Machinery, 2022
ISBN 10 : 1450399681 ISBN 13 : 9781450399685
Langue: anglais
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 90
Autre deviseQuantité disponible : 3 disponible(s)
Ajouter au panierEtat : New.
Edité par Association for Computing Machinery, 2022
ISBN 10 : 1450399681 ISBN 13 : 9781450399685
Langue: anglais
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 85,63
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Edité par Association for Computing Machinery, 2022
ISBN 10 : 1450399681 ISBN 13 : 9781450399685
Langue: anglais
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 97,03
Autre deviseQuantité disponible : 3 disponible(s)
Ajouter au panierEtat : New. 1st edition NO-PA16APR2015-KAP.
Edité par Association for Computing Machinery, 2022
ISBN 10 : 1450399681 ISBN 13 : 9781450399685
Langue: anglais
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 85,31
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
EUR 95,28
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. 2022. hardcover. . . . . . Books ship from the US and Ireland.
Edité par Association for Computing Machinery, 2022
ISBN 10 : 1450399681 ISBN 13 : 9781450399685
Langue: anglais
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 93,01
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 83,44
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. 233 pages. 9.21x7.56x2.83 inches. In Stock.
Edité par Association of Computing Machinery,U.S., US, 2022
ISBN 10 : 1450399665 ISBN 13 : 9781450399661
Langue: anglais
Vendeur : Rarewaves USA United, OSWEGO, IL, Etats-Unis
EUR 80,27
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback. Etat : 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.
Edité par Association For Computing Machinery 6504698 Dez 2022, 2022
ISBN 10 : 1450399665 ISBN 13 : 9781450399661
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 66,66
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 112,08
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 218 pages. 9.50x7.50x0.75 inches. In Stock.