Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Per Austrin, Rajsekar Manokaran, Cenny Wenner. On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems. Theory of Computing, 11:257-283, 2015. [doi]
Abstract is missing.