|
NP-complete problems - BooksClick a book link to view all the available details:· Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science, 1001)
| ||||||||||||||||
| |||||||||||||||||
| |||||||||||||||||
©1997 - 2006 CentraSoft.Com | Privacy Policy | Terms Of Use Adobe Corp. in no way endorses or is affiliated with Centrasoft Corp. | |||||||||||||||||
