@InProceedings{kabanets_et_al:LIPIcs.APPROX-RANDOM.2018.46,
author = {Kabanets, Valentine and Lu, Zhenjian},
title = {{Satisfiability and Derandomization for Small Polynomial Threshold Circuits}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {46:1--46:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.46},
URN = {urn:nbn:de:0030-drops-94507},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.46},
annote = {Keywords: constant-depth circuits, polynomial threshold functions, circuit analysis algorithms, SAT, derandomization, quantified derandomization, pseudorandom generators.}
}