scientific article; zbMATH DE number 3922536

MaRDI QIDQ3698700zbMATH OpenFDO

Authors Walter Oberschelp

Publication date 1984

zbMATH Keywords

lattice differentiationpeak testrandom Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 856969
• scientific article; zbMATH DE number 4094807
• An efficient algorithm to generate prime implicants
• Computing prime implicates by pruning the search space and accelerating subsumption
• Algorithms for selective enumeration of prime implicants
• Polynomial-time algorithms for generation of prime implicants
• scientific article; zbMATH DE number 3570346
• scientific article; zbMATH DE number 5670033
• Simple parallel algorithms for primality testing and integer factorization

Cited in

(8)

• Algorithms for selective enumeration of prime implicants
• Computing prime implicates by pruning the search space and accelerating subsumption
• scientific article; zbMATH DE number 5670033 (Why is no real title available?)
• scientific article; zbMATH DE number 4094807 (Why is no real title available?)
• scientific article; zbMATH DE number 3570346 (Why is no real title available?)
• scientific article; zbMATH DE number 856969 (Why is no real title available?)
• A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function
• Almost all comparability graphs are UPO

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 Q3698700)