scientific article; zbMATH DE number 4060726

zbMATH Open0649.68053MaRDI QIDQ3795232FDOQ3795232

Authors: Juraj Hromkovič, Juraj Procházka 

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• 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 Keywords

lower boundsbranching programssystolic arraysarea complexityVLSI computationsdeterministic sequential computationsnonuniform computing model

Mathematics Subject Classification ID

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

Cited In (5)

• Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)