Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
Complexity classes
P versus NP problem
NP
P
Low
EXPTIME
NC
Parameterized complexity
Karp–Lipton theorem
Theoretical computer science