Topological aspects of Boolean functions
Combinatorics
2022-11-15 v2
Abstract
We discuss ways in which tools from topology can be used to derive lower bounds for the circuit complexity of Boolean functions.
Cite
@article{arxiv.2205.14424,
title = {Topological aspects of Boolean functions},
author = {Anders Björner and Mark Goresky and Robert MacPherson},
journal= {arXiv preprint arXiv:2205.14424},
year = {2022}
}