# BPL

> complexity class of problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with two-sided error

**Wikidata**: [Q4836264](https://www.wikidata.org/wiki/Q4836264)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/BPL_(complexity))  
**Source**: https://4ort.xyz/entity/bpl