# Category:Probabilistic complexity classes

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

## Pages in category "Probabilistic complexity classes"

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

### A

- AM (complexity)
*(computing)* - AWPP (complexity)
*(computing)*

### B

- BPL (complexity)
*(computing)* - BPP (complexity)
*(computing)* - BQP
*(computing)*

### C

- Claw finding problem
*(computing)* - Co-RP
*(computing)*

### H

- Hamiltonian complexity
*(computing)*

### I

- IP (complexity)
*(computing)*

### M

- MA (complexity)
*(computing)*

### P

- PL (complexity)
*(computing)* - PostBQP
*(computing)* - PP (complexity)
*(computing)*

### Q

- QCMA
*(computing)* - QIP (complexity)
*(computing)* - QMA
*(computing)*

### R

- RL (complexity)
*(computing)* - RP (complexity)
*(computing)*

### Z

- ZPP (complexity)
*(computing)*