1450 search results - page 15 / 290 » On the Complexity of Hardness Amplification |
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
FOSSACS
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
SBCCI
2004
ACM
14 years 1 months ago
2004
ACM
Software synthesis is defined as the task of translating a specification into a software program, in a general purpose language, in such a way that this software can be compiled...