2018 search results - page 171 / 404 » Code Normal Forms |
138
click to vote
SAT
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...
116
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
116
click to vote
ISSAC
1995
Springer
15 years 6 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
132
click to vote
PARLE
1987
15 years 6 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
124
click to vote
WSC
2007
15 years 5 months ago
2007
This tutorial explains the basics of linear regression metamodels—especially low-order polynomials—and the corresponding statistical designs—namely, fractional factorial des...