1450 search results - page 76 / 290 » On the Complexity of Hardness Amplification |
AAAI
2000
13 years 10 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
ECCC
2007
13 years 9 months ago
2007
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
CPAIOR
2010
Springer
13 years 7 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
ICCBR
1999
Springer
14 years 1 months ago
1999
Springer
Software programming is a complex task. To help the user with this task, we are developing a case-based reasoning tool capable of suggesting code to the programmer (software reuse...