159 search results - page 31 / 32 » On the Complexity of SAT |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
DAC
2008
ACM
14 years 6 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
ASPLOS
2006
ACM
13 years 11 months ago
2006
ACM
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
JELIA
2004
Springer
13 years 11 months ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
ASPDAC
2000
ACM
13 years 10 months ago
2000
ACM
Many intellectual property protection (IPP) techniques have been proposed. Their primary objectives are providing convincible proof of authorship with least degradation of the qua...