144 search results - page 10 / 29 » The complexity of Boolean formula minimization |
DAM
1999
13 years 7 months ago
1999
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
DAC
2005
ACM
13 years 9 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
SIAMCOMP
2002
13 years 7 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
CDES
2008
13 years 9 months ago
2008
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary multi-outp...