scientific article
From MaRDI portal
Publication:3832044
zbMath0676.68014MaRDI QIDQ3832044
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Communication theory (94A05)
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: