Some Area-Time Tradeoffs for VLSI
From MaRDI portal
Publication:3954825
DOI10.1137/0211060zbMath0492.68041MaRDI QIDQ3954825
Leslie M. Goldschlager, Richard P. Brent
Publication date: 1982
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6c2554951c4933847c2cbdab15a07fd247a38e6f
models of computation; set equality; crossing sequences; context-free language recognition; set disjointness; area-time bounds on VLSI circuits; circuit- value problem; evaluation of propositional calculus formulae
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
03B05: Classical propositional logic
Related Items