STOC
2007
ACM
15 years 5 days ago
2007
ACM
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 ...
STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days ago
2007
ACM
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....
STOC
2007
ACM
15 years 5 days ago
2007
ACM
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...
STOC
2007
ACM
15 years 5 days ago
2007
ACM
STOC
2007
ACM
15 years 5 days ago
2007
ACM
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...
STOC
2007
ACM
15 years 5 days ago
2007
ACM
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...
STOC
2007
ACM
15 years 5 days ago
2007
ACM
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...