1450 search results - page 109 / 290 » On the Complexity of Hardness Amplification |
SAT
2004
Springer
14 years 2 months ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
GMP
2003
IEEE
14 years 2 months ago
2003
IEEE
Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this c...
INFOCOM
2003
IEEE
14 years 2 months ago
2003
IEEE
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
KBSE
2003
IEEE
14 years 2 months ago
2003
IEEE
Mathematical modeling and simulation of complex physical systems are emerging as key technologies in engineering. Modern approaches to physical system simulation allow users to sp...