Monday, 22 July 2013

On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems. (arXiv:1307.5090v1 [cs.CC])

Subjects: Computational Complexity (cs.CC) Sorry, I could not read the content fromt this page.

View the original article here

Posted by at
Labels: , , , , , ,

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)