Sciweavers

IACR
2011
110views more  IACR 2011»
12 years 3 months ago
Decoding One Out of Many
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...
Nicolas Sendrier
SAT
2011
Springer
263views Hardware» more  SAT 2011»
12 years 7 months ago
Failed Literal Detection for QBF
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 ...
Florian Lonsing, Armin Biere
AML
2011
221views Mathematics» more  AML 2011»
12 years 7 months ago
A remark on the tree property in a choiceless context
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...
Arthur W. Apter
AI
2011
Springer
12 years 7 months ago
Finding Small Backdoors in SAT Instances
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...
Zijie Li, Peter van Beek
TCS
1998
13 years 3 months ago
Axiomatisation of Functional Dependencies in Incomplete Relations
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 (...
Mark Levene, George Loizou