Balanced max 2-sat might not be the hardest
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Per Austrin
Balanced max 2-sat might not be the hardest
STOC, 2007.

STOC 2007
DBLP
Scholar
DOI
Full names Links ISxN
@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,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.