On algorithms for construction of all irreducible partial covers

DOI10.1016/J.IPL.2007.02.009zbMATH Open1184.68608OpenAlexW2016898304MaRDI QIDQ2379946FDOQ2379946

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
• The Maximum Latency and Identification of Positive Boolean Functions
• Almost all monotone Boolean functions are polynomially learnable using membership queries
• Stochastic Algorithms: Foundations and Applications

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)