Sciweavers

STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 11 months ago
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
We study linear programming relaxations of Vertex Cover and Max Cut arising from repeated applications of the "lift-and-project" method of Lovasz and Schrijver starting ...
Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
STOC
2007
ACM
121views Algorithms» more  STOC 2007»
14 years 11 months ago
An efficient parallel repetition theorem for Arthur-Merlin games
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 11 months ago
Linear probing with constant independence
Anna Pagh, Rasmus Pagh, Milan Ruzic
STOC
2007
ACM
97views Algorithms» more  STOC 2007»
14 years 11 months ago
Search via quantum walk
Frédéric Magniez, Ashwin Nayak, Jere...
STOC
2007
ACM
84views Algorithms» more  STOC 2007»
14 years 11 months ago
Lower bounds in communication complexity based on factorization norms
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
Nati Linial, Adi Shraibman
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
14 years 11 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 11 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 11 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 11 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous