On algorithms for construction of all irreducible partial covers
From MaRDI portal
(Redirected from Publication:2379946)
Recommendations
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
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)