Recognition of interval Boolean functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4053069 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1759476 (Why is no real title available?)
- Computing the minimum DNF representation of Boolean functions defined by intervals
- Error-free and best-fit extensions of partially defined Boolean functions
- Horn functions and their DNFs
- The Problem of Simplifying Truth Functions
Cited in
(10)- A polynomial algorithm for minimal interval representation
- Computing the minimum DNF representation of Boolean functions defined by intervals
- Interior and exterior functions of positive Boolean functions.
- Recognizing the presence of a growing unessential argument of Boolean functions
- scientific article; zbMATH DE number 4035001 (Why is no real title available?)
- scientific article; zbMATH DE number 3893164 (Why is no real title available?)
- Relations between threshold and \(k\)-interval Boolean functions
- Properties of the interval graph of a Boolean function
- Recognition of tractable DNFs representable by a constant number of intervals
- Properties of Switch-List Representations of Boolean Functions
This page was built for publication: Recognition of interval Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029585)