First Page | Document Content | |
---|---|---|
![]() Date: 2004-12-20 06:07:323SUM Computational geometry NP-complete problems Analysis of algorithms Time complexity Reduction Algorithm Boolean satisfiability problem Complexity class Theoretical computer science Applied mathematics Computational complexity theory | Add to Reading List |
![]() | PDF DocumentDocID: 1xSAp - View Document |
![]() | PDF DocumentDocID: 1xP7V - View Document |
![]() | PDF DocumentDocID: 1x8Vj - View Document |
![]() | PDF DocumentDocID: 1x2r1 - View Document |
![]() | PDF DocumentDocID: 1wHMX - View Document |