scientific article; zbMATH DE number 4051518

MaRDI QIDQ3787930zbMATH OpenFDO

Authors Juraj Hromkovič

Publication date 1988

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4061153
• scientific article; zbMATH DE number 4108150
• scientific article; zbMATH DE number 4078802
• scientific article; zbMATH DE number 4102489
• scientific article; zbMATH DE number 3905849
• A model of computation for VLSI with related complexity results
• scientific article; zbMATH DE number 3990864
• The advantages of a new approach to defining the communication complexity for VLSI
• The advantages of a new approach to defining the communication complexity for VLSI
• On the VLSI complexity of some arithmetic and numerical problems

Cited in

(21)

• On problem transformability in VLSI
• On the VLSI complexity of some arithmetic and numerical problems
• Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
• Lower bounds on the area complexity of Boolean circuits
• scientific article; zbMATH DE number 4181292 (Why is no real title available?)
• scientific article; zbMATH DE number 3847304 (Why is no real title available?)
• scientific article; zbMATH DE number 4135399 (Why is no real title available?)
• scientific article; zbMATH DE number 3919826 (Why is no real title available?)
• A model of computation for VLSI with related complexity results
• The VLSI Complexity of Selected Graph Problems
• scientific article; zbMATH DE number 4043241 (Why is no real title available?)
• scientific article; zbMATH DE number 4061153 (Why is no real title available?)
• scientific article; zbMATH DE number 4078802 (Why is no real title available?)
• scientific article; zbMATH DE number 4102489 (Why is no real title available?)
• scientific article; zbMATH DE number 4108150 (Why is no real title available?)
• scientific article; zbMATH DE number 61460 (Why is no real title available?)
• scientific article; zbMATH DE number 4003486 (Why is no real title available?)
• A nonlinear lower bound on the practical combinational complexity
• A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
• A nonlinear lower bound on the practical combinational complexity

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 Q3787930)