a solution is correct (without worrying about how hard it might be to fi nd the solution). Problems in NP are
relatively easy—if only we could guess the right solution, we could then quickly test it. Note that NP does
not stand for “non-polynomial”, by present day defi nition, as was pointed out in Chapter 14. There are many
complexity classes that are much harder than NP.
PSPACE Problems that can be solved using a reasonable amount of memory (again defi ned formally as a
polynomial in the input size) without regard to how much time the solution takes.
EXPTIME Problems that can be solved in exponential time. This class contains most problems we are
likely to come across. This class is not all-inclusive; ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.