Lingua: Inglese
Editore: Association for Computing Machinery 6504698, 2022
ISBN 10: 1450399665 ISBN 13: 9781450399661
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 57,33
Quantità: 15 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
EUR 60,68
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 64,68
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 60,22
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2022. paperback. . . . . .
Da: Majestic Books, Hounslow, Regno Unito
EUR 69,99
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Association for Computing Machinery 6504698, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 73,47
Quantità: 15 disponibili
Aggiungi al carrelloHRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Lingua: Inglese
Editore: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 78,29
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. 1st edition NO-PA16APR2015-KAP.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 66,80
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Kennys Bookstore, Olney, MD, U.S.A.
EUR 76,03
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2022. paperback. . . . . . Books ship from the US and Ireland.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 71,41
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.
Lingua: Inglese
Editore: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 84,59
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 73,58
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 71,08
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 77,88
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2022. hardcover. . . . . .
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 83,31
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new.
Da: Revaluation Books, Exeter, Regno Unito
EUR 84,47
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 233 pages. 9.21x7.56x2.83 inches. In Stock.
Lingua: Inglese
Editore: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Da: Majestic Books, Hounslow, Regno Unito
EUR 91,49
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 85,66
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. 1st edition NO-PA16APR2015-KAP.
Da: Kennys Bookstore, Olney, MD, U.S.A.
EUR 98,71
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2022. hardcover. . . . . . Books ship from the US and Ireland.
Lingua: Inglese
Editore: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 91,47
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Association of Computing Machinery,U.S., 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 93,73
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. New copy - Usually dispatched within 4 working days.
Lingua: Inglese
Editore: Association for Computing Machinery, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 95,32
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 107,99
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new.
EUR 113,46
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 218 pages. 9.50x7.50x0.75 inches. In Stock.
EUR 73,70
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.
Lingua: Inglese
Editore: Association For Computing Machinery 6504698 Dez 2022, 2022
ISBN 10: 1450399665 ISBN 13: 9781450399661
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 89,58
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Lingua: Inglese
Editore: Association For Computing Machinery 6504698 Dez 2022, 2022
ISBN 10: 1450399681 ISBN 13: 9781450399685
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 116,49
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: 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.