MA

Similar topics in Freebase

• 

  PSPACE

  In computational complexity theory, PSPACE is the set of all decision problems which can be solved by a Turing machine using a polynomial amount of space. If we denote by SPACE(t(n)), the set of all problems that can be solved by Turing machines using at most t(n) space for some function t of the...
• 

  NP-complete

  In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC), is a class of problems having two properties: Although any given solution to such a problem can be verified quickly, there is no known efficient way to locate a solution in the first place; indeed, the...