Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
11 years 2 months ago
First to market is not everything: an analysis of preferential attachment with fitness
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...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
STOC
2007
ACM
133views Algorithms» more  STOC 2007»
11 years 2 months ago
Interpolation of depth-3 arithmetic circuits with two multiplication gates
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...
Amir Shpilka
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
11 years 2 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
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...
Ronen Shaltiel, Christopher Umans
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
11 years 2 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»
11 years 2 months ago
An efficient parallel repetition theorem for Arthur-Merlin games
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
11 years 2 months ago
Linear probing with constant independence
Anna Pagh, Rasmus Pagh, Milan Ruzic
STOC
2007
ACM
97views Algorithms» more  STOC 2007»
11 years 2 months ago
Search via quantum walk
Frédéric Magniez, Ashwin Nayak, Jere...
STOC
2007
ACM
84views Algorithms» more  STOC 2007»
11 years 2 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»
11 years 2 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
books