The Complexity of Near-Optimal Programmable Logic Array Folding (Q3796745)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4062586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Near-Optimal Programmable Logic Array Folding |
scientific article; zbMATH DE number 4062586 |
Statements
The Complexity of Near-Optimal Programmable Logic Array Folding (English)
0 references
1988
0 references
VLSI
0 references
programmable logic array
0 references
NP-complete
0 references
folding
0 references
PLA
0 references
heuristics
0 references
0.8970984816551208
0 references
0.8948455452919006
0 references
0.8629557490348816
0 references
