IACR
2011
12 years 10 months ago
2011
Generic decoding of linear codes is the best known attack against most code-based cryptosystems. Understanding and measuring the complexity of the best decoding technique is thus n...
SAT
2011
Springer
13 years 1 months ago
2011
Springer
Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields ...
AML
2011
13 years 2 months ago
2011
We show that the consistency of the theory “ZF + DC + Every successor cardinal is regular + Every limit cardinal is singular + Every successor cardinal satisfies the tree prope...
AI
2011
Springer
13 years 2 months ago
2011
Springer
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
TCS
1998
13 years 10 months ago
1998
Incomplete relations are relations which contain null values, whose meaning is \value is at present unknown". Such relations give rise to two types of functional dependency (...