Report copyright - Complexity Classes Kang Yu 1. NP NP : nondeterministic polynomial time NP-complete : 1.In NP (can be verified in polynomial time) 2.Every problem in NP
Please pass captcha verification before submit form
Please pass captcha verification before submit form