PP (Q1563053)

From Wikidata
Jump to navigation Jump to search
complexity class of decision problems solvable by a probabilistic Turing machine in polynomial time with error probability <½ for all instances
  • Majority-P
edit
Language Label Description Also known as
English
PP
complexity class of decision problems solvable by a probabilistic Turing machine in polynomial time with error probability <½ for all instances
  • Majority-P

Statements

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit