Complete Problems for Parallel Classes is a computational problem that belongs to a given parallel complexity class and is representative of the hardest problems in that class, in the sense that every other problem in the class can be reduced to it via a suitable reduction while preserving the constraints on parallel computation.