On k-term DNF with largest number of prime implicants

Robert H. Sloan, Balázs Szörényi, György Turán. On k-term DNF with largest number of prime implicants. Electronic Colloquium on Computational Complexity (ECCC), (023), 2005. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.