Boolean Function Complexity Advances and Frontiers

By Stasys Jukna. Bull. EATCS, 2012

480 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/9685266d0abb1681120373da3ef512972763468e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Raman Arora

Citations in the corpus

• Understanding Deep Neural Networks with Rectified Linear Units (2016, background): “Our investigation of the function space represented by ReLU DNNs also takes inspiration from the classical theory of circuit complexity; we refer the reader to [1, 3, 5, 13, 17, 27, 30, 37] for various surveys of this deep and fascinating field.”