@InProceedings{bhangale_et_al:LIPIcs.CCC.2020.9,
author = {Bhangale, Amey and Khot, Subhash},
title = {{Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut}},
booktitle = {35th Computational Complexity Conference (CCC 2020)},
pages = {9:1--9:15},
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.9},
URN = {urn:nbn:de:0030-drops-125610},
doi = {10.4230/LIPIcs.CCC.2020.9},
annote = {Keywords: Simultaneous CSPs, Unique Games hardness, Max-Cut}
}