Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms
From MaRDI portal
Publication:5413210
DOI10.1134/S096554251309008XzbMath1299.06028MaRDI QIDQ5413210
Publication date: 28 April 2014
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Related Items (2)
On the Complexity of Minimizing Quasicyclic Boolean Functions ⋮ Shortest and minimal disjunctive normal forms of complete functions
Cites Work
- The DNF exception problem
- Sharpening Occam's razor
- On the necessity of Occam algorithms
- Algebraic-logic synthesis of correct recognition procedures based on elementary algorithms
- Implementation of a class of Boolean functions with a small number of zeros by irredundant disjunctive normal forms
- Simple disjunctive normal forms of Boolean functions with a restricted number of zeros
- Boolean function minimization in the class of disjunctive normal forms
- Comparative analysis of the complexity of Boolean functions with a small number of zeros
- Computational complexity of Boolean functions
- A theory of the learnable
- On the complexity of shortest disjunctive normal forms of Boolean functions
- An algorithm for constructing a disjunctive normal form equivalent to the product of the left-hand sides of Nelson Boolean equations
- Disjunctive normal forms of Boolean functions with a small number of zeros
- Correct algebras of bounded capacity on the set of algorithms of the calculation of estimates
- The shortest disjunctive normal form of a random Boolean function
- Hardness of approximate two-level logic minimization and PAC learning with membership queries
- Discrete analysis of feature descriptions in recognition problems of high dimensionality
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms