×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [instance q of problem]
1 NP-completeness Lecture 2: Jan 11. 2 P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many
216 views
NP-complete examples CSC3130 Tutorial 11 Xiao Linfu
[email protected]
Department of Computer Science & Engineering Fall 2009
217 views
NP-completeness
49 views