8 search results - page 1 / 2 » Constant Depth Circuits, Fourier Transform, and Learnability |
FOCS
1989
IEEE
13 years 9 months ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denot...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
d Abstract] Dana Angluin James Aspnes Jiang Chen Yinghua Wu We propose a new model for exact learning of acyclic circuits using experiments in which chosen values may be assigned ...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...