Topological aspects of Boolean functions
Anders Bj\"orner, Mark Goresky, Robert MacPherson
TL;DR
This paper explores how topological tools can be applied to establish lower bounds on the circuit complexity of Boolean functions, providing a novel approach to understanding computational difficulty.
Contribution
It introduces a topological framework for deriving circuit complexity bounds, bridging topology and computational complexity theory.
Findings
Topological methods yield new lower bounds for Boolean circuit complexity.
The approach offers insights into the structure of Boolean functions.
Potential for extending topological techniques to other complexity measures.
Abstract
We discuss ways in which tools from topology can be used to derive lower bounds for the circuit complexity of Boolean functions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Commutative Algebra and Its Applications · semigroups and automata theory