Lower bounds on the area complexity of Boolean circuits

DOI10.1016/0304-3975(92)90079-UzbMath0769.68045WikidataQ126789386 ScholiaQ126789386MaRDI QIDQ1193877

Sergej A. Ložkin, Nadežda A. Škalikova, Andrej I. Rybko, Alexander A. Sapozhenko, Juraj Hromkovič

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Boolean functionslower boundcommunication complexityBoolean circuitslayoutarea complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

A nonlinear lower bound on the practical combinational complexity

Cites Work

• Linear lower bounds on unbounded fan-in Boolean circuits
• Communication complexity
• The planar realization of Boolean functions
• A result on k-valent graphs and its application to a graph embedding problem
• The advantages of a new approach to defining the communication complexity for VLSI
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item