322 search results - page 2 / 65 » Satisfiability Coding Lemma |
AIPS
2006
13 years 7 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
ECCC
1998
13 years 5 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
ISCAS
2007
IEEE
13 years 12 months ago
2007
IEEE
— Hermitian Codes offer desirable properties such as large code lengths, good error-correction at high code rates, etc. The main problem in making Hermitian codes practical is to...
ICEIS
2006
IEEE
13 years 11 months ago
2006
IEEE
JISE
2010
13 years 12 days ago
2010
