Multiple cuts, input repetition, and VLSI complexity (Q1095662)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multiple cuts, input repetition, and VLSI complexity |
scientific article; zbMATH DE number 4028901
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiple cuts, input repetition, and VLSI complexity |
scientific article; zbMATH DE number 4028901 |
Statements
Multiple cuts, input repetition, and VLSI complexity (English)
0 references
1987
0 references
This paper explores the use of multiple cut methods for determining the complexity of VLSI circuits.
0 references
lower bounds
0 references
multiple cut methods
0 references
complexity of VLSI circuits
0 references
