Go to the corresponding LIPIcs Volume Portal 
Rajgopal, Ninad ; Santhanam, Rahul ; Srinivasan, Srikanth
pdfformat: 

@InProceedings{rajgopal_et_al:LIPIcs:2018:9660, author = {Ninad Rajgopal and Rahul Santhanam and Srikanth Srinivasan}, title = {{Deterministically Counting Satisfying Assignments for ConstantDepth Circuits with Parity Gates, with Implications for Lower Bounds}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {78:178:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770866}, ISSN = {18688969}, year = {2018}, volume = {117}, editor = {Igor Potapov and Paul Spirakis and James Worrell}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9660}, URN = {urn:nbn:de:0030drops96607}, doi = {10.4230/LIPIcs.MFCS.2018.78}, annote = {Keywords: circuit satisfiability, circuit lower bounds, polynomial method, derandomization} }
Keywords:  circuit satisfiability, circuit lower bounds, polynomial method, derandomization  
Seminar:  43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)  
Issue Date:  2018  
Date of publication:  20.08.2018 