Igor Carboni Oliveira, Rahul Santhanam. Majority is Incompressible by AC^0[p] Circuits. In David Zuckerman, editor, 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA. Volume 33 of LIPIcs, pages 124-157, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]
@inproceedings{OliveiraS15-0, title = {Majority is Incompressible by AC^0[p] Circuits}, author = {Igor Carboni Oliveira and Rahul Santhanam}, year = {2015}, doi = {10.4230/LIPIcs.CCC.2015.124}, url = {http://dx.doi.org/10.4230/LIPIcs.CCC.2015.124}, researchr = {https://researchr.org/publication/OliveiraS15-0}, cites = {0}, citedby = {0}, pages = {124-157}, booktitle = {30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA}, editor = {David Zuckerman}, volume = {33}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-939897-81-1}, }