@Article{agrawal_et_al:DagRep.4.9.85,
author = {Agrawal, Manindra and Kabanets, Valentine and Thierauf, Thomas and Umans, Christopher},
title = {{Algebra in Computational Complexity (Dagstuhl Seminar 14391)}},
pages = {85--105},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {4},
number = {9},
editor = {Agrawal, Manindra and Kabanets, Valentine and Thierauf, Thomas and Umans, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.9.85},
URN = {urn:nbn:de:0030-drops-48851},
doi = {10.4230/DagRep.4.9.85},
annote = {Keywords: Computational Complexity, lower bounds, approximazation, pseudo-randomness, derandomization, circuits}
}