Boolean circuit complexity and two-dimensional cover problems

DOI10.1145/3718746MaRDI QIDQ6949655zbMATH OpenFDO

Authors Bruno Pasqualotto Cavalar, Igor C. Oliveira

Publication date 1 August 2025

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

Boolean circuitsfusion methodcomplexity lower boundsgraph complexity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Networks and circuits as models of computation; circuit complexity (68Q06) Communication complexity, information complexity (68Q11)

This page was built for publication: Boolean circuit complexity and two-dimensional cover problems

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