Skip Navigation

The Computer Journal 1986 29(2):103-108; doi:10.1093/comjnl/29.2.103
© 1986 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Jarosz, J.
Right arrow Articles by Jaworowski, J. R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Computer Tree – the Power of Parallel Computations

J. Jarosz and J. R. Jaworowski §

Institute of Computer Science, The Stanislaw Staszic University of Mining and Metallurgy, 30-059 Cracow, Poland

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.

Received August 1984.

* To whom correpondence should be addressed.

§ Institute of Computer Science, The Stanislaw Staszic University of Mining and Metallurgy, 30-059 Cracow, Poland, al. Mickiewicza 30/A4


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.