# Category:Complexity classes

Computing portal |

Here is a list of articles in the Complexity classes category of the Computing portal that unifies foundations of mathematics and computations using computers.

## Subcategories

This category has only the following subcategory.

### P

## Pages in category "Complexity classes"

The following 88 pages are in this category, out of 88 total.

- Complexity class
*(computing)*

### *

- List of complexity classes
*(computing)* - List of computability and complexity topics
*(computing)*

### 2

- 2-EXPTIME
*(computing)*

### A

- AC (complexity)
*(computing)* - AC0
*(computing)* - ACC0
*(computing)* - ALL (complexity)
*(computing)* - APX
*(computing)* - Arithmetical hierarchy
*(computing)*

### C

- CC (complexity)
*(computing)* - Co-NP
*(computing)* - Co-NP-complete
*(computing)* - Co-RE
*(computing)* - Co-RE-complete
*(computing)*

### E

- E (complexity)
*(computing)* - ELEMENTARY
*(computing)* - ESPACE
*(computing)* - Exponential hierarchy
*(computing)* - EXPSPACE
*(computing)* - EXPTIME
*(computing)*

### F

- FL (complexity)
*(computing)* - FNP (complexity)
*(computing)* - FO (complexity)
*(computing)* - FP (complexity)
*(computing)* - FPT (complexity class)
*(computing)*

### G

- GapP
*(computing)* - GI (complexity)
*(computing)* - GI-complete
*(computing)*

### H

- HO (complexity)
*(computing)*

### L

- L (complexity)
*(computing)* - LH (complexity)
*(computing)* - LOGCFL
*(computing)*

### N

- NC (complexity)
*(computing)* - NE (complexity)
*(computing)* - NEXPTIME
*(computing)* - NL (complexity)
*(computing)* - NL-complete
*(computing)* - Nonelementary problem
*(computing)* - NP (complexity)
*(computing)* - NP-completeness
*(computing)* - NP-easy
*(computing)* - NP-equivalent
*(computing)* - NP-hardness
*(computing)* - NP-intermediate
*(computing)* - NSPACE
*(computing)* - NTIME
*(computing)*

### P

- P (complexity)
*(computing)* - P-complete
*(computing)* - Parity P
*(computing)* - PH (complexity)
*(computing)* - PLS (complexity)
*(computing)* - PolyL
*(computing)* - Polynomial-time approximation scheme
*(computing)* - PPA (complexity)
*(computing)* - PPAD (complexity)
*(computing)* - PPP (complexity)
*(computing)* - PR (complexity)
*(computing)* - Pseudo-polynomial time
*(computing)* - Pseudo-polynomial transformation
*(computing)* - PSPACE
*(computing)* - PSPACE-complete
*(computing)* - PSPACE-hard
*(computing)*

### Q

- Quasi-polynomial time
*(computing)*

### R

- R (complexity)
*(computing)* - Random-access Turing machine
*(computing)* - RE (complexity)
*(computing)* - RE-complete
*(computing)*

### S

- S2P (complexity)
*(computing)* - SC (complexity)
*(computing)* - Sharp-P-complete
*(computing)* - ♯P-complete
*(computing)* - SL (complexity)
*(computing)* - SNP (complexity)
*(computing)* - SO (complexity)
*(computing)* - Strong NP-completeness
*(computing)* - SUBEXP
*(computing)*

### T

- TC (complexity)
*(computing)* - TC0
*(computing)* - TFNP
*(computing)*

### U

- UP (complexity)
*(computing)*

### W

- W hierarchy
*(computing)* - Weak NP-completeness
*(computing)*

### X

- XP (complexity class)
*(computing)*

### ♯

- ♯P
*(computing)*