0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R1,000 - R2,500 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

On Monotonicity Testing and the 2-to-2 Games Conjecture (Hardcover): Dor Minzer On Monotonicity Testing and the 2-to-2 Games Conjecture (Hardcover)
Dor Minzer
R2,100 Discovery Miles 21 000 Ships in 10 - 15 working days
On Monotonicity Testing and the 2-to-2 Games Conjecture (Paperback): Dor Minzer On Monotonicity Testing and the 2-to-2 Games Conjecture (Paperback)
Dor Minzer
R1,579 Discovery Miles 15 790 Ships in 10 - 15 working days

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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Russell Hobbs Toaster (2 Slice…
R707 Discovery Miles 7 070
Monami Retractable Crayons (12 Colours)
 (1)
R83 R66 Discovery Miles 660
Rogue One: A Star Wars Story - Blu-Ray…
Felicity Jones, Diego Luna, … Blu-ray disc R382 Discovery Miles 3 820
Bostik Double-Sided Tape (18mm x 10m…
 (1)
R31 Discovery Miles 310
Mellerware Swiss - Plastic Floor Fan…
R371 Discovery Miles 3 710
Malesation Dildo Barry Dildo (Black)
R679 R399 Discovery Miles 3 990
St Cyprians Grade 4 School Pack - 2025
R1,039 Discovery Miles 10 390
Love Sux
Avril Lavigne CD R178 R148 Discovery Miles 1 480
Higher
Michael Buble CD  (1)
R459 Discovery Miles 4 590
Wonka
Timothee Chalamet Blu-ray disc R250 Discovery Miles 2 500

 

Partners