Back to Results
First PageMeta Content
Complexity classes / P versus NP problem / NP / P / Low / EXPTIME / NC / Parameterized complexity / Karp–Lipton theorem / Theoretical computer science / Computational complexity theory / Applied mathematics


Algorithms: Complexity Classes and Lower Bounds Martin Held FB Computerwissenschaften Universität Salzburg A-5020 Salzburg, Austria
Add to Reading List

Document Date: 2014-10-17 01:42:07

Open Document

File Size: 971,15 KB

Share Result on Facebook

Country

Austria / /

/

IndustryTerm

educational tool / /

Organization

Applications Lab / SALZBURG UNIVERSITAT Computational Geometry and Applications Lab / UNIVERSITAT / /

SocialTag