Minimizability of random Boolean functions

DOI10.1109/12.21151MaRDI QIDQ5375508zbMATH OpenOpenAlexFDO

Authors H. Fleisher, João Matheus Jury Giraldi, R. Phoenix, M. A. Tavel

Publication date 14 September 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.21151

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 3974901
• scientific article; zbMATH DE number 4010400
• scientific article; zbMATH DE number 2210682
• On a minimization problem for a set of Boolean functions
• scientific article; zbMATH DE number 3894979
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• scientific article; zbMATH DE number 1537526
• Stochastic approximation of Boolean functions
• scientific article; zbMATH DE number 2208579
• Minimal complexes of faces of a random Boolean function.

Cited in

(2)

• Oblivious bounds on the probability of boolean functions
• Polynomial-time algorithms for generation of prime implicants

This page was built for publication: Minimizability of random Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375508)