738 search results - page 14 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
ICS
2010
Tsinghua U.
15 years 1 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
101
Voted
CAISE
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
MOC
2011
14 years 15 days ago
2011
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...