scientific article
From MaRDI portal
Publication:3835036
zbMath0678.68068MaRDI QIDQ3835036
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Circuits, networks (94C99) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (3)
Nonlinear lower bounds on the number of processors of circuits with sublinear separators ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ A nonlinear lower bound on the practical combinational complexity
This page was built for publication:
