Computer Tree - the Power of Parallel Computations
Jeremi Jan Jarosz · The Computer Journal · 1986
Computer Tree (CT) is the non-standard computer structure which consists of a large number of processing elements, which are connected so that they form a binary tree. We have proved that every problem belonging to the polynomial-time hierarchy can be solved on CT in polynomial time. A 0 (n3) algorithm for the maximal clique decision problem was presented, as an example of the real power of parallel computations on CT.