Editing BPP (complexity) (section)

== References ==
{{Reflist}}
* <span id="Kabanets">Valentine Kabanets (2003). "CMPT 710 – Complexity Theory: Lecture 16". [[Simon Fraser University]].</span>
* {{cite book|author = Christos Papadimitriou|author-link = Christos Papadimitriou| year = 1993 | title = Computational Complexity | publisher = Addison Wesley | edition = 1st | isbn = 0-201-53082-1}} Pages 257–259 of section 11.3: Random Sources. Pages 269–271 of section 11.4: Circuit complexity.
* {{cite book | author = Michael Sipser | author-link = Michael Sipser | year = 1997 | title = Introduction to the Theory of Computation | publisher = PWS Publishing | isbn = 0-534-94728-X | url-access = registration | url = https://archive.org/details/introductiontoth00sips }} Section 10.2.1: The class BPP, pp.&nbsp;336–339.
*{{cite book
 | last1 = Karpinski | first1 = Marek | author1-link = Marek Karpinski
 | last2 = Verbeek | first2 = Rutger
 | editor-last = Börger | editor-first = Egon
 | contribution = Randomness, provability, and the separation of Monte Carlo time and space
 | doi = 10.1007/3-540-18170-9_166
 | pages = 189–207
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = Computation Theory and Logic, In Memory of Dieter Rödding
 | volume = 270
 | year = 1987a}}
* {{cite journal| journal=Information and Computation| volume=75| issue=2| year=1987b| pages=178–189| title=On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes| last1=Karpinski| first1=Marek| author-link1=Marek Karpinski| last2=Verbeek | first2=Rutger| doi=10.1016/0890-5401(87)90057-5| doi-access=free}}
* Arora, Sanjeev; Boaz Barak (2009). "Computational Complexity: A Modern Approach".