Go to the corresponding LIPIcs Volume Portal 
Saptharishi, Ramprasad ; Tengse, Anamay
pdfformat: 

@InProceedings{saptharishi_et_al:LIPIcs:2018:9905, author = {Ramprasad Saptharishi and Anamay Tengse}, title = {{Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees}}, booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)}, pages = {6:16:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770934}, ISSN = {18688969}, year = {2018}, volume = {122}, editor = {Sumit Ganguly and Paritosh Pandya}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9905}, URN = {urn:nbn:de:0030drops99050}, doi = {10.4230/LIPIcs.FSTTCS.2018.6}, annote = {Keywords: Unambiguous Circuits, Readonce Oblivious ABPs, Polynomial Identity Testing, Lower Bounds, Algebraic Circuit Complexity} }
Keywords:  Unambiguous Circuits, Readonce Oblivious ABPs, Polynomial Identity Testing, Lower Bounds, Algebraic Circuit Complexity  
Seminar:  38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)  
Issue Date:  2018  
Date of publication:  23.11.2018 