Study of the complexity of an algorithm to derive the complement of a binary function (Q3352504): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207218908925390 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144526903 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: MINI: A Heuristic Approach for Logic Minimization / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:28, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Study of the complexity of an algorithm to derive the complement of a binary function |
scientific article |
Statements
Study of the complexity of an algorithm to derive the complement of a binary function (English)
0 references
1989
0 references
complement of a binary function
0 references
combinational logic
0 references
programmable logic arrays
0 references
