738 search results - page 41 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
90
Voted
PODC
2010
ACM
14 years 10 months ago
2010
ACM
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
FUIN
2010
14 years 8 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
105
click to vote
FLOPS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
PODS
2012
ACM
13 years 5 days ago
2012
ACM
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
ANTS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. For K3 surfaces, we derive some conditions the characteristic polynomial of the Frobenius on the ´etale cohomology must satisfy. These conditions may be used to speed up...