A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
From MaRDI portal
Recommendations
- A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
- Minimizing the average query complexity of learning monotone Boolean functions
- Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
- Generation of Boolean functions under the assumption of monotonicity
- The Maximum Latency and Identification of Positive Boolean Functions
Cites work
- A theory of the learnable
- scientific article; zbMATH DE number 4164874 (Why is no real title available?)
- scientific article; zbMATH DE number 4095482 (Why is no real title available?)
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- scientific article; zbMATH DE number 1555949 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- On generating all maximal independent sets
- On one criterion of the optihality of an algorithm for evaluating monotonic boolean functions
Cited in
(6)- Guided inference of nested monotone Boolean functions
- Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
- The Maximum Latency and Identification of Positive Boolean Functions
- A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
- scientific article; zbMATH DE number 1522935 (Why is no real title available?)
- The splitting technique in monotone recognition
This page was built for publication: A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487975)
