complexity-classes

Articles

• NC (complexity)Class in computational complexity theory
• Elementary recursive functionConcept in computability theory
• ♯PComplexity class
• NP-intermediateComplexity class of problems
• Parity P
• NEXPTIMEConcept in computational complexity theory
• PR (complexity)
• PPA (complexity)Complexity class
• P (complexity)Class of problems solvable in polynomial time
• S2P (complexity)
• PLS (complexity)Complexity class
• Parity P
• SNP (complexity)Complexity class
• SNP (complexity)Complexity class
• PPP (complexity)Complexity class
• L (complexity)Complexity class (logarithmic space)
• SNP (complexity)Complexity class
• EXPTIMEAlgorithmic complexity class
• RE (complexity)Complexity class
• NC (complexity)Class in computational complexity theory
• Elementary recursive functionConcept in computability theory
• ♯PComplexity class
• PSPACESet of decision problems
• TFNPComplexity class
• NEXPTIMEConcept in computational complexity theory
• PR (complexity)
• P/polySet of problems solved by small circuits
• NC (complexity)Class in computational complexity theory
• Elementary recursive functionConcept in computability theory
• ♯PComplexity class
• NP-intermediateComplexity class of problems
• DLOGTIME
• DLOGTIME
• NEXPTIMEConcept in computational complexity theory
• PR (complexity)
• NP-intermediateComplexity class of problems
• SL (complexity)
• PPAD (complexity)Complexity class
• UP (complexity)
• NL (complexity)Computational complexity
• NL-complete
• FP (complexity)Complexity class
• NSPACEMemory space for a non-deterministic Turing machine
• P-completeClass in computational complexity theory
• Co-NPComplexity class
• Parity P
• SNP (complexity)Complexity class
• DLOGTIME
• PSPACE-completeType of decision problem in computer science
• NP (complexity)Complexity class used to classify decision problems