A linear time algorithm for recognizing regular Boolean functions

DOI10.1016/S0196-6774(02)00003-2MaRDI QIDQ3150280zbMATH OpenFDO

Authors Kazuhisa Makino

Publication date 30 September 2002

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0196-6774(02)00003-2

zbMATH Keywords

decreasing strength

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1522935
• Dualization of regular Boolean functions
• Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
• scientific article; zbMATH DE number 26594
• A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions

Cited in

(6)

• scientific article; zbMATH DE number 165544 (Why is no real title available?)
• Influence decision models: from cooperative game theory to social network analysis
• On the complexity of the decisive problem in simple and weighted games
• scientific article; zbMATH DE number 1522935 (Why is no real title available?)
• An O(nm)-time algorithm for computing the dual of a regular Boolean function
• Forms of representation for simple games: sizes, conversions and equivalences

This page was built for publication: A linear time algorithm for recognizing regular Boolean functions

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