Semelectivity is not sufficient
type: Item
instance of: scholarly article
title: Semelectivity is not sufficient
zbMATH Open document ID: 0714.68047
DOI: 10.1016/0020-0190(91)90033-E
author: Pavol Ďuriš
author: Imrich Vrt'o
published in: Information Processing Letters
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W35
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 4176459
zbMATH Keywords: computational complexity
zbMATH Keywords: VLSI model
zbMATH Keywords: lower bound
zbMATH Keywords: area complexity
MaRDI profile type: Publication
cites work: Information transfer and area-time tradeoffs for VLSI multiplication
cites work: Area-time lower-bound techniques with applications to sorting
cites work: The Area-Time Complexity of Binary Multiplication
cites work: Q3711746
cites work: Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations
cites work: A minimum-area circuit for \(\ell\)-selection
cites work: On problem transformability in VLSI
cites work: Information Transfer in Distributed Computing with Applications to VLSI
cites work: Where-oblivious is not sufficient
cites work: Minimum Storage Sorting Networks
cites work: Q3691061
cites work: Q3326832
full work available at URL: 0020-0190(91)90033-e
OpenAlex ID: W2036305438
description: scientific article; zbMATH DE number 4176459