On algorithms for construction of all irreducible partial covers

DOI10.1016/J.IPL.2007.02.009MaRDI QIDQ2379946zbMATH OpenOpenAlexFDO

Authors Mikhail Moshkov

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.02.009

zbMATH Keywords

computational complexityirreducible partial covertotally polynomial algorithm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05)

Recommendations

• Polynomial-delay construction of irreducible coverings of a Boolean matrix
• Construction of irredundant coverings of a Boolean matrix
• scientific article; zbMATH DE number 2102648
• Computing small partial coverings
• On Partial Covers, Reducts and Decision Rules

Cites work

• scientific article; zbMATH DE number 3150822 (Why is no real title available?)
• scientific article; zbMATH DE number 3825713 (Why is no real title available?)
• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• Almost all monotone Boolean functions are polynomially learnable using membership queries
• Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
• Stochastic Algorithms: Foundations and Applications
• The Maximum Latency and Identification of Positive Boolean Functions

Cited in

(1)

• Algorithmic aspects of branched coverings I/V. Van Kampen's theorem for bisets

This page was built for publication: On algorithms for construction of all irreducible partial covers

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