Go to the corresponding Portal 
Jansen, Maurice ; Santhanam, Rahul
pdfformat: 

@InProceedings{jansen_et_al:LIPIcs:2012:3430, author = {Maurice Jansen and Rahul Santhanam}, title = {{Stronger Lower Bounds and RandomnessHardness TradeOffs Using Associated Algebraic Complexity Classes}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {519530}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897354}, ISSN = {18688969}, year = {2012}, volume = {14}, editor = {Christoph D{\"u}rr and Thomas Wilke}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3430}, URN = {urn:nbn:de:0030drops34307}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2012.519}, annote = {Keywords: Computational Complexity, Circuit Lower Bounds, Polynomial Identity Testing, Derandomization} }
Keywords:  Computational Complexity, Circuit Lower Bounds, Polynomial Identity Testing, Derandomization  
Seminar:  29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)  
Issue Date:  2012  
Date of publication:  24.02.2012 