# AC0

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Electronic Colloquium on Computational Complexity
- 2016

In this talk, we will discuss some questions related to polynomial approximations of AC0. A classic result due to Tarui (1991… (More)

Is this relevant?

2015

2015

- Conference on Computational Complexity
- 2015

We consider randomness extraction by AC circuits. The main parameter, n, is the length of the source, and all other parameters… (More)

Is this relevant?

2014

2014

- ITCS
- 2014

Pseudorandom functions (PRFs) play a fundamental role in symmetric-key cryptography. However, they are inherently complex and… (More)

Is this relevant?

2014

2014

- Computational Complexity Conference
- 2014

We show that AC0 circuits on n variables with depth d and size m have at most 2−Ω(k/ log d−1m) of their Fourier mass at level k… (More)

Is this relevant?

2012

2012

- Quantum Information & Computation
- 2012

We show that any quantum algorithm deciding whether an input functionf from [n] to [n] is 2-to-1 or almost 2-to-1 requires Θ(n… (More)

Is this relevant?

2007

2007

- STOC
- 2007

We prove that AC<sup>0</sup> cannot be efficiently simulated by MAJºMAJ circuits. Namely, we construct an AC<sup>0</sup> circuit… (More)

Is this relevant?

1999

1999

- Theor. Comput. Sci.
- 1999

Addressing a problem of Fredman and Willard, we implement fusion trees in deterministic linear space using AC0 instructions only.

Is this relevant?

1998

1998

- Electronic Colloquium on Computational Complexity
- 1998

Continuing the study of the relationship between TC 0 , AC 0 and arithmetic circuits, started by Agrawal et al. 1], we answer a… (More)

Is this relevant?

1997

1997

- Electronic Colloquium on Computational Complexity
- 1997

We show that searching a width k maze is complete for Πk, i.e., for the k’th level of the AC0 hierarchy. Equivalently, st… (More)

Is this relevant?

1993

1993

- Theor. Comput. Sci.
- 1993

Tarui, J., Probabilistic polynomials, AC” functions and the polynomial-time hierarchy, Theoretical Computer Science 113 (1993… (More)

Is this relevant?