scientific article

zbMath0644.94027MaRDI QIDQ3787930

Juraj Hromkovič

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational properties of VLSI circuitslower bounds on the area-time squared complexity measure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Complexity of computation (including implicit computational complexity) (03D15)

Related Items

Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits ⋮ A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity ⋮ Nonlinear lower bounds on the number of processors of circuits with sublinear separators ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ Lower bounds on the area complexity of Boolean circuits ⋮ A nonlinear lower bound on the practical combinational complexity ⋮ Unnamed Item