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 (Q1149955): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of prime implicants / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Addressing Problem for Loop Switching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5584564 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:40, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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 |
scientific article |
Statements
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 (English)
0 references
1980
0 references
Boolean function
0 references
disjunctive normal form
0 references
factorization
0 references
