A nonlinear lower bound on the practical combinational complexity

DOI10.1007/3-540-55210-3_191MaRDI QIDQ5096789zbMATH OpenOpenAlexFDO

Authors Xaver Gubáš, Juraj Hromkovič, Juraj Waczulík

Publication date 18 August 2022

Published in STACS 92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55210-3_191

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)

Recommendations

• A nonlinear lower bound on the practical combinational complexity
• scientific article; zbMATH DE number 4104386
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
• scientific article; zbMATH DE number 139642
• scientific article; zbMATH DE number 4102490

Cites work

• scientific article; zbMATH DE number 3858396 (Why is no real title available?)
• scientific article; zbMATH DE number 3873237 (Why is no real title available?)
• scientific article; zbMATH DE number 3906394 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 4051518 (Why is no real title available?)
• scientific article; zbMATH DE number 4108150 (Why is no real title available?)
• scientific article; zbMATH DE number 4112041 (Why is no real title available?)
• scientific article; zbMATH DE number 3285250 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
• A 3n-lower bound on the network complexity of Boolean functions
• A Boolean function requiring 3n network size
• A Separator Theorem for Planar Graphs
• A class of Boolean functions with linear combinational complexity
• Communication complexity
• Explicit constructions of linear-sized superconcentrators
• Lower bounds for synchronous circuits and planar circuits
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
• The advantages of a new approach to defining the communication complexity for VLSI
• The planar realization of Boolean functions
• Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen

Cited in

(6)

• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
• scientific article; zbMATH DE number 4104386 (Why is no real title available?)
• scientific article; zbMATH DE number 139639 (Why is no real title available?)
• scientific article; zbMATH DE number 4047102 (Why is no real title available?)
• scientific article; zbMATH DE number 4102490 (Why is no real title available?)
• A nonlinear lower bound on the practical combinational complexity

This page was built for publication: A nonlinear lower bound on the practical combinational complexity

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