Nick's Class (NC) is the class of problems that can be decided in poly-log time using a polynomial number of processors.I want to know about the exponential analogue, which would cover problems that can be decided in polynomial time using an exponential number of processors.What I'm looking for is a name for this class and any known relations between this class and other complexity classes, or any canonical problems for the class. It seems straightforward that it would contain NP and co-NP, and i think it is contained within PSPACE, but I'm not sure much else about it.
Exponential analogue of NC?
complexity theory;reference request;parallel computing;complexity classes