%0 Conference Paper %1 conf/approx/AllenderFT19 %A Allender, Eric %A Farach-Colton, Martin %A Tsai, Meng-Tsung %B APPROX-RANDOM %D 2019 %E Achlioptas, Dimitris %E Végh, László A. %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 16:1-16:23 %T Syntactic Separation of Subset Satisfiability Problems. %U http://dblp.uni-trier.de/db/conf/approx/approx2019.html#AllenderFT19 %V 145 %@ 978-3-95977-125-2

@inproceedings{conf/approx/AllenderFT19, added-at = {2021-10-14T00:00:00.000+0200}, author = {Allender, Eric and Farach-Colton, Martin and Tsai, Meng-Tsung}, biburl = {https://www.bibsonomy.org/bibtex/29811a1445a10b9c297e6f085b0957bf7/dblp}, booktitle = {APPROX-RANDOM}, crossref = {conf/approx/2019}, editor = {Achlioptas, Dimitris and Végh, László A.}, ee = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.16}, interhash = {0c6d1c053c241bd4c87013b9ac5167b9}, intrahash = {9811a1445a10b9c297e6f085b0957bf7}, isbn = {978-3-95977-125-2}, keywords = {dblp}, pages = {16:1-16:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-10T00:34:07.000+0200}, title = {Syntactic Separation of Subset Satisfiability Problems.}, url = {http://dblp.uni-trier.de/db/conf/approx/approx2019.html#AllenderFT19}, volume = 145, year = 2019 }