@InProceedings{allender_et_al:LIPIcs.APPROX-RANDOM.2019.16, author = {Allender, Eric and Farach-Colton, Mart{\'\i}n and Tsai, Meng-Tsung}, title = {{Syntactic Separation of Subset Satisfiability Problems}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {16:1--16:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.16}, URN = {urn:nbn:de:0030-drops-112319}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.16}, annote = {Keywords: Syntactic Class, Exponential Time Hypothesis, APX, PTAS} }