Class Description

coNQP: Complement of NQP

Equals C₌P [FGH+98].

Linked From

C₌P: Exact-Counting Polynomial-Time

The class of decision problems solvable by an NP machine such that the number of accepting paths exactly equals the number of rejecting paths, if and only if the answer is 'yes.'

Equals coNQP [FGH+98].

More about...