Other important complexity classes include BPP, ZPP and RP, which are defined using probabilistic Turing machines; AC and NC, which are defined using Boolean circuits; and BQP and QMA, which are defined using quantum Turing machines. #P is an important complexity class of counting problems (not decision problems). Classes like IP and AM are defined using Interactive proof systems. ALL is the class of all decision problems.
What are three examples of complexity classes associated with definitions established by probabilistic Turing machines? AC and NC are complexity classes typically associated with what type of circuit? BQP and QMA are examples of complexity classes most commonly associated with what type of Turing machine? What is the expression used to represent a complexity class of counting problems? IP and AM are most commonly defined by what type of proof system?