scientific article; zbMATH DE number 3085175
From MaRDI portal
zbMath0053.19802MaRDI QIDQ5822054
Publication date: 1953
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Polynomial-time algorithms for regular set-covering and threshold synthesis, Approximating Boolean Functions with Depth-2 Circuits, An O(m n) algorithm for regular set-covering problems, On the fixed-parameter tractability of the equivalence test of monotone normal forms, Partially unate Boolean functions: properties of their sum-of-products representations, Invariant inference with provable complexity from the monotone theory, SAT-based invariant inference and its relation to concept learning, Complexity of DNF minimization and isomorphism testing for monotone formulas, How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms, The fixing groups for the 2-asummable Boolean functions
