1450 search results - page 17 / 290 » On the Complexity of Hardness Amplification |
BMCBI
2010
13 years 7 months ago
2010
Background: Cancer is a complex disease where various types of molecular aberrations drive the development and progression of malignancies. Large-scale screenings of multiple type...
FOCS
2000
IEEE
14 years 2 days ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...
DAC
1997
ACM
13 years 12 months ago
1997
ACM
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...