Topological aspects of Boolean functions
arXiv:2205.14424
Abstract
We discuss ways in which tools from topology can be used to derive lower bounds for the circuit complexity of Boolean functions.
arXiv:2205.14424
We discuss ways in which tools from topology can be used to derive lower bounds for the circuit complexity of Boolean functions.