@InProceedings{ilango:LIPIcs.CCC.2020.31,
author = {Ilango, Rahul},
title = {{Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing Formulas}},
booktitle = {35th Computational Complexity Conference (CCC 2020)},
pages = {31:1--31:35},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-156-6},
ISSN = {1868-8969},
year = {2020},
volume = {169},
editor = {Saraf, Shubhangi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.31},
URN = {urn:nbn:de:0030-drops-125834},
doi = {10.4230/LIPIcs.CCC.2020.31},
annote = {Keywords: minimum circuit size problem, minimum formula size problem, gate elimination, search to decision reduction, self-reducibility}
}