Sorry, we do not have enough data to show an influence graph for this author.
- Full text PDF available (0)
Journals and Conferences
The field of computer science known as computational complexity deals, among other things, with writing algorithms that scale efficiently. Within this, “P” refers to the set of problems which can be solved efficiently by computers (in polynomial time), while “NP,” nondeterministic polynomial, refers to problems whose solutions can be easily checked if your… (More)