![Complexity classes / P versus NP problem / NP / P / Low / EXPTIME / NC / Parameterized complexity / Karp–Lipton theorem / Theoretical computer science / Computational complexity theory / Applied mathematics Complexity classes / P versus NP problem / NP / P / Low / EXPTIME / NC / Parameterized complexity / Karp–Lipton theorem / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/d92d914f1622056ee8f713ce8a307cad.jpg)
| Document Date: 2014-10-17 01:42:07 Open Document File Size: 971,15 KBShare Result on Facebook
Country Austria / / / IndustryTerm educational tool / / Organization Applications Lab / SALZBURG UNIVERSITAT Computational Geometry and Applications Lab / UNIVERSITAT / /
SocialTag |