118 search results - page 14 / 24 » Complexity Cores and Hard Problem Instances |
IJCAI
2001
13 years 8 months ago
2001
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
DATE
1999
IEEE
13 years 11 months ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
SAT
2004
Springer
14 years 21 days 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 ...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
CONSTRAINTS
2006
13 years 7 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...