Multiple cuts, input repetition, and VLSI complexity
type: Item
instance of: scholarly article
title: Multiple cuts, input repetition, and VLSI complexity
zbMATH Open document ID: 0632.68045
DOI: 10.1016/0020-0190(87)90194-3
author: Peter Hochschild
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
review text: This paper explores the use of multiple cut methods for determining the complexity of VLSI circuits.
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 4028901
zbMATH Keywords: lower bounds
zbMATH Keywords: multiple cut methods
zbMATH Keywords: complexity of VLSI circuits
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90194-3
OpenAlex ID: W2171080370
cites work: Q3326832
description: scientific article; zbMATH DE number 4028901