Sciweavers

79 search results - page 5 / 16
» stoc 2005
Sort
View
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
15 years 10 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan
STOC
2005
ACM
84views Algorithms» more  STOC 2005»
15 years 10 months ago
Learning nonsingular phylogenies and hidden Markov models
In this paper, we study the problem of learning phylogenies and hidden Markov models. We call the Markov model nonsingular if all transtion matrices have determinants bounded away...
Elchanan Mossel, Sébastien Roch
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 10 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren
STOC
2005
ACM
122views Algorithms» more  STOC 2005»
15 years 10 months ago
The price of anarchy of finite congestion games
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
George Christodoulou, Elias Koutsoupias
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
15 years 10 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka