Introduction to Circuit Complexity: A Uniform Approach

By H. Vollmer. 2010

445 citations recorded by the source corpus.

How researchers see this paper

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

A fully homomorphic encryption scheme (2009, background): “The complexity of a circuit can be expressed in terms of a depth of a circuit, which we will not discuss here, but can it be found in [9] .”
Theory and Applications of Models of Computation: 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings (2019, methodology): “provide several approximation algorithms for several simple diffusion models [24,26] as well as a more general decreasing cascade model, where a behaviour spreads in a cascading fashion according to a probabilistic rule [25].”
Why Does Deep and Cheap Learning Work So Well? (2016, result): “This result may be compared to problems in Boolean circuit complexity, notably the question of whether TC0 = TC1 [50].”
The DL-Lite Family and Relations (2009, background): “A typical example of an AC problem is evaluation of first-order queries over databases (or model checking of first-order sentences over finite models), where only the database (first-order model) is regarded as the input and the query (first-order sentence) is assumed to be fixed (Abiteboul, Hull, &”