50 citations · 96 across the 18 of their papers we have counts for
1 paper · 1 filter
Anders Björner, Mark Goresky, Robert MacPherson
We discuss ways in which tools from topology can be used to derive lower bounds for the circuit complexity of Boolean functions.