⊕P (Q7137529)
Jump to navigation
Jump to search
class of decision problems solvable by a nondeterministic Turing machine in polynomial time, where the acceptance condition is that the number of accepting computation paths is odd
- parity P
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ⊕P |
class of decision problems solvable by a nondeterministic Turing machine in polynomial time, where the acceptance condition is that the number of accepting computation paths is odd |
|