Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Neng Huang and Aaron Potechin. On the Approximability of Presidential Type Predicates. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 58:1-58:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{huang_et_al:LIPIcs.APPROX/RANDOM.2020.58, author = {Huang, Neng and Potechin, Aaron}, title = {{On the Approximability of Presidential Type Predicates}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {58:1--58:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Byrka, Jaros{\l}aw and Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.58}, URN = {urn:nbn:de:0030-drops-126612}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.58}, annote = {Keywords: constraint satisfaction problems, approximation algorithms, presidential type predicates} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Xiaoyu He, Neng Huang, and Xiaoming Sun. On the Decision Tree Complexity of String Matching. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 45:1-45:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{he_et_al:LIPIcs.ESA.2018.45, author = {He, Xiaoyu and Huang, Neng and Sun, Xiaoming}, title = {{On the Decision Tree Complexity of String Matching}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {45:1--45:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.45}, URN = {urn:nbn:de:0030-drops-95082}, doi = {10.4230/LIPIcs.ESA.2018.45}, annote = {Keywords: String Matching, Decision Tree Complexity, Boolean Function, Algebraic Method} }
Feedback for Dagstuhl Publishing