scientific article; zbMATH DE number 4133979
From MaRDI portal
Publication:3035231
[For the entire collection see Zbl 0686.00021.] Motivated by integrated circuit design, the problem of factoring of logic functions is considered. The computation of factors can be reduced to the problem of determining the prime implicants. The optimal selection of factors consists of solving three covering problems. Efficient algorithms are proposed and discussed.
Recommendations
- Factorization of Boolean polynomials: parallel algorithms and experimental evaluation
- scientific article; zbMATH DE number 4077312
- A fast output-sensitive algorithm for Boolean matrix multiplication
- A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
- Polylog depth circuits for integer factoring and discrete logarithms
- Fast computing the algebraic degree of Boolean functions
- An improvement on the complexity of factoring read-once Boolean functions
- scientific article; zbMATH DE number 2114153
- scientific article; zbMATH DE number 3894983
- Speeding up discrete log and factoring based schemes via precomputations
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3035231)