Editing Complexity class (section)

==Bibliography==
* {{cite web |last1=Aaronson |first1=Scott |author-link=Scott Aaronson |title=P=?NP |url=https://eccc.weizmann.ac.il/report/2017/004/ |website=Electronic Colloquim on Computational Complexity |publisher=Weizmann Institute of Science |date=8 January 2017|archive-url=https://web.archive.org/web/20200617175017/https://eccc.weizmann.ac.il/report/2017/004/download/|archive-date=June 17, 2020|url-status=live}}
* {{cite book |last1=Arora |first1=Sanjeev |last2=Barak|author1-link=Sanjeev Arora |first2=Boaz|author2-link=Boaz Barak |title=Computational Complexity: A Modern Approach |url=https://archive.org/details/computationalcom00aror |url-access=limited |date=2009 |publisher=Cambridge University Press |isbn=978-0-521-42426-4|at=[http://theory.cs.princeton.edu/complexity/book.pdf Draft]. [https://web.archive.org/web/20220223014316/https://theory.cs.princeton.edu/complexity/book.pdf Archived] from the original on February 23, 2022.}}
* {{cite web |last1=Arora |first1=Sanjeev |title=Complexity classes having to do with counting |url=https://www.cs.princeton.edu/courses/archive/spring03/cs522/book2.ps |website=Computer Science 522: Computational Complexity Theory |publisher=Princeton University |date=Spring 2003 |archive-url=https://web.archive.org/web/20220521204917/https://www.cs.princeton.edu/courses/archive/spring03/cs522/book2.ps |archive-date= May 21, 2022 |url-status=live}}
* {{cite web |last1=Barak |first1=Boaz |author-link=Boaz Barak |title=Complexity of counting |url=https://www.cs.princeton.edu/courses/archive/spring06/cos522/count.pdf |website=Computer Science 522: Computational Complexity |publisher=[[Princeton University]] |date=Spring 2006|at=[https://web.archive.org/web/20210403191124/https://www.cs.princeton.edu/courses/archive/spring06/cos522/count.pdf Archived] from the original on April 3, 2021.}}
* {{Cite book |last=Fortnow |first=Lance |title=Complexity Theory Retrospective II |publisher=Springer |year=1997 |isbn=9780387949734 |editor-last=Hemaspaandra |editor-first=Lane A. |pages=81–106 |chapter=Counting Complexity |editor-last2=Selman |editor-first2=Alan L. |chapter-url=https://lance.fortnow.com/papers/files/counting.pdf |archive-url=https://web.archive.org/web/20220618222631/https://lance.fortnow.com/papers/files/counting.pdf |archive-date=June 18, 2022}}
* {{cite web |last=Gasarch |first=William I. |date=2019 |url=https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/pollpaper3.pdf |url-status=live |title=Guest Column: The Third P =? NP Poll |website=[[University of Maryland]]|archive-url=https://web.archive.org/web/20211102102656/https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/pollpaper3.pdf|archive-date=November 2, 2021}}
* {{Cite book |last=Goldreich |first=Oded |author-link=Oded Goldreich |url=https://www.wisdom.weizmann.ac.il/~oded/PSX/prpr-r.pdf |title=Theoretical Computer Science. Lecture Notes in Computer Science, vol 3895 |publisher=Springer |year=2006 |isbn=978-3-540-32881-0 |editor-last=Goldreich |editor-first=Oded |pages=254–290 |chapter=On Promise Problems: A Survey |volume=3895 |doi=10.1007/11685654_12 |editor-last2=Rosenberg |editor-first2=Arnold L. |editor-last3=Selman |editor-first3=Alen L. |chapter-url=https://www.wisdom.weizmann.ac.il/~oded/PSX/prpr-r.pdf |archive-url=https://web.archive.org/web/20210506131638/https://www.wisdom.weizmann.ac.il/~oded/PSX/prpr-r.pdf |archive-date=May 6, 2021 |url-status=live}}
* {{cite encyclopedia
 | last = Johnson | first = David S.
 | title = A Catalog of Complexity Classes
 | doi = 10.1016/b978-0-444-88071-0.50007-2
 | pages = 67–161
 | publisher = Elsevier
 | series = Handbook of Theoretical Computer Science
 | encyclopedia = Algorithms and Complexity
 | year = 1990| isbn = 978-0-444-88071-0
 }}
* {{Cite web |last=Lee |first=James R. |date=May 22, 2014 |title=Lecture 16 |url=https://courses.cs.washington.edu/courses/cse431/14sp/scribes/lec16.pdf |url-status=live |archive-url=https://web.archive.org/web/20211129075858/https://courses.cs.washington.edu/courses/cse431/14sp/scribes/lec16.pdf |archive-date=November 29, 2021 |access-date=October 5, 2022 |website=CSE431: Introduction to Theory of Computation |publisher=[[University of Washington]]}}
* {{Cite book |last=Rich |first=Elaine|author-link=Elaine Rich |title=Automata, Computability and Complexity: Theory and Applications |publisher=[[Prentice Hall]] |year=2008 |isbn=978-0132288064|url=https://www.cs.utexas.edu/~ear/cs341/automatabook/AutomataTheoryBook.pdf|archive-url=https://web.archive.org/web/20220121174820/https://www.cs.utexas.edu/~ear/cs341/automatabook/AutomataTheoryBook.pdf|archive-date=January 21, 2022|url-status=live}}
* {{cite book|last=Sipser|first=Michael|author-link=Michael Sipser|title=Introduction to the Theory of Computation|edition=2nd|year=2006|publisher=Thomson Course Technology|location=USA|isbn=0-534-95097-3|url=http://fuuu.be/polytech/INFOF408/Introduction-To-The-Theory-Of-Computation-Michael-Sipser.pdf|archive-url=https://web.archive.org/web/20220207141236/http://fuuu.be/polytech/INFOF408/Introduction-To-The-Theory-Of-Computation-Michael-Sipser.pdf|archive-date=February 7, 2022}}
* {{Cite web |last=Watrous |first=John |author-link=John Watrous (computer scientist) |date=April 11, 2006 |title=Lecture 22: Quantum computational complexity |url=https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.22.pdf |url-status=live |archive-url=https://web.archive.org/web/20220618022421/https://cs.uwaterloo.ca/~watrous/QC-notes/QC-notes.22.pdf |archive-date=June 18, 2022 |website=[[University of Waterloo]]}}