scientific article; zbMATH DE number 4060726

MaRDI QIDQ3795232zbMATH OpenFDO

Authors Juraj Hromkovič, Juraj Procházka

Publication date 1988

zbMATH Keywords

area complexitybranching programsdeterministic sequential computationslower boundsnonuniform computing modelsystolic arraysVLSI computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 61460
• Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits
• scientific article; zbMATH DE number 4172378
• scientific article; zbMATH DE number 4078802
• scientific article; zbMATH DE number 47855

Cited in

(5)

• Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits
• scientific article; zbMATH DE number 4172378 (Why is no real title available?)
• scientific article; zbMATH DE number 4078802 (Why is no real title available?)
• scientific article; zbMATH DE number 58305 (Why is no real title available?)
• scientific article; zbMATH DE number 61460 (Why is no real title available?)

This page was built for publication:

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