Amanote Research
Register
Sign In
Prime Implicant Computation Using Satisfiability Algorithms
doi 10.1109/tai.1997.632261
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
V.M. Manquinho
P.F. Flores
J.P.M. Silva
A.L. Oliveira
Publisher
IEEE Comput. Soc
Related search
On Using Satisfiability-Based Pruning Techniques in Covering Algorithms
New Algorithms for Exact Satisfiability
BRICS Report Series
Algorithms and Computation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Mixed Parallel Execution of Algorithms for Satisfiability Problem
Converting Online Algorithms to Local Computation Algorithms
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Solving Satisfiability Problems Using Reconfigurable Computing
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Hardware
Electronic Engineering
Electrical
Architecture
Software
Computation of Private Key Based on Divide-By-Prime for Luc Cryptosystems
Journal of Computer Science
Computer Networks
Software
Artificial Intelligence
Communications
Local Algorithms for the Prime Factorization of Strong Product Graphs
Mathematics in Computer Science
Mathematics
Computational Mathematics
Applied Mathematics
Computational Theory
On the Software Computation of the Formulae for the N-Th Prime Number
Notes on Number Theory and Discrete Mathematics
