224 search results - page 9 / 45 » Algorithms for Solving Boolean Satisfiability in Combination... |
133
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
126
Voted
DCC
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
131
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
115
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
156
Voted
SODA
2010
ACM
15 years 1 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...