Some Area-Time Tradeoffs for VLSI

DOI10.1137/0211060MaRDI QIDQ3954825zbMATH OpenOpenAlexFDO

Authors Richard P. Brent, Leslie M. Goldschlager

Publication date 1982

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/6c2554951c4933847c2cbdab15a07fd247a38e6f

zbMATH Keywords

area-time bounds on VLSI circuitscircuit- value problemcontext-free language recognitioncrossing sequencesevaluation of propositional calculus formulaemodels of computationset disjointnessset equality

Mathematics Subject Classification ID

Classical propositional logic (03B05) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cited in

(1)

• Area-period tradeoffs for multiplication of rectangular matrices

This page was built for publication: Some Area-Time Tradeoffs for VLSI

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3954825)