STOC
2007
ACM
15 years 23 days ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
STOC
2007
ACM
15 years 23 days ago
2007
ACM
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
STOC
2007
ACM
15 years 23 days ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
STOC
2007
ACM
15 years 23 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 23 days ago
2007
ACM
STOC
2007
ACM
15 years 23 days ago
2007
ACM
STOC
2007
ACM
15 years 23 days ago
2007
ACM
STOC
2007
ACM
15 years 23 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 23 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 23 days ago
2007
ACM
