Per Austrin
Balanced max 2-sat might not be the hardest
STOC, 2007.
@inproceedings{STOC-2007-Austrin, author = "Per Austrin", booktitle = "{Proceedings of the 39th Annual ACM Symposium on Theory of Computing}", doi = "10.1145/1250790.1250818", isbn = "978-1-59593-631-8", pages = "189--197", publisher = "{ACM}", title = "{Balanced max 2-sat might not be the hardest}", year = 2007, }