What's the class of problems solvable in polynomial time with an exponential number of processors? I am asking this because I'm curious about the class of problems that could feasable be solved on a hyperbolic plane. On a hyperbolic plane it is possible to construct an exponential number of processors in polynomial time.
$\begingroup$
$\endgroup$
-
1$\begingroup$ How are the results of the exponentially many processors combined to make a final decision? $\endgroup$ – D.W.♦ Jun 8 at 16:56
