Boolesche Minimalpolynome und Überdeckungsprobleme

DOI10.1007/BF00289615zbMath0322.94023OpenAlexW2026545811MaRDI QIDQ1224047

Wolfgang J. Paul

Publication date: 1975

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289615

Mathematics Subject Classification ID

Related Items (3)

Interval stability and interval covering property in finite posets ⋮ Hardness of approximate two-level logic minimization and PAC learning with membership queries ⋮ Minimal polynomials for the conjunction of functions on disjoint variables can be very simple

Cites Work

• Unnamed Item
• Some simplified NP-complete graph problems
• Algebraic Topological Methods for the Synthesis of Switching Systems. I
• A Learning Network Using Adaptive Threshold Elements
• The complexity of theorem-proving procedures
• The Problem of Simplifying Truth Functions

This page was built for publication: Boolesche Minimalpolynome und Überdeckungsprobleme