pdfformat: 

@InProceedings{hansen:DSP:2008:1782, author = {Kristoffer Arnsfelt Hansen}, title = {Depth Reduction for Circuits with a Single Layer of Modular Counting Gates}, booktitle = {Computational Complexity of Discrete Problems }, year = {2008}, editor = {Peter Bro Miltersen and R{\"u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek}, number = {08381}, series = {Dagstuhl Seminar Proceedings}, ISSN = {18624405}, publisher = {Schloss Dagstuhl  LeibnizZentrum fuer Informatik, Germany}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1782}, annote = {Keywords: Boolean Circuits, Randomized Polynomials, Fourier sums} }
Keywords:  Boolean Circuits, Randomized Polynomials, Fourier sums  
Seminar:  08381  Computational Complexity of Discrete Problems  
Related Scholarly Article:  
Issue date:  2008  
Date of publication:  2008 