Sur le cardinal maximum de la base complete d'une fonction booleenne, en fonction du nombre de conjonctions de l'une de ses formes normales

DOI10.1016/0012-365X(80)90056-4zbMath0455.05011OpenAlexW2035332232MaRDI QIDQ1149955

Jean-Marie Laborde

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(80)90056-4

zbMATH Keywords

factorizationBoolean functiondisjunctive normal form

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial inequalities (05A20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean algebras (Boolean rings) (06E99)

Cites Work

• Unnamed Item
• On the number of prime implicants
• On the Addressing Problem for Loop Switching

This page was built for publication: Sur le cardinal maximum de la base complete d'une fonction booleenne, en fonction du nombre de conjonctions de l'une de ses formes normales