BPP, or Bounded-error Probabilistic Polynomial time, is a complexity class in computational theory that includes decision problems solvable by a probabilistic Turing machine in polynomial time with a bounded error probability. It represents problems where there's a small chance of error in the solution, but the algorithm can be run multiple times to reduce this error to an acceptable level.