Researchers have developed a theory of the parallel complexity of computational problems analogous to the theory of NP-completeness. A problem is said to belong to the class NC (Nick's Class) if it can be solved in time polylogarithmic in the size of the problem using at most a polynomial number of processors.
Jan 25, 2021 · A problem is parallel feasible iff it is sequentially feasible and parallel complexity theory works only with complexity class P.
People also ask
What is parallel complexity?
What is complexity theory in simple terms?
What is the theory of parallel algorithms?
What is the theory of parallel computing?
30-day returns In stock
This book presents a unified theory of parallel computation based on a network model.
We define a complexity class PE of problems that can be solved by parallel algorithms that are efficient (the speedup is proportional to the number of ...
complexity theory of parallel computation
Book by Ian Parberry
Parallel complexity theory is one of the fastest-growing fields in theoretical computer science. This rapid growth has led to a proliferation of parallel machine models and theoretical frameworks. This book presents a unified theory of parallel... Google Books
Originally published: 1987
Author: Ian Parberry
Jul 30, 2024 · Parallel complexity theory dives into the efficiency of algorithms running on multiple processors. It's all about measuring how fast and how much work these ...
If you wish to provide access to this work in either print or electronic form, you may do so by providing a link to, and/or listing the URL for the online ...
In computer science, the analysis of parallel algorithms is the process of finding the computational complexity of algorithms executed in parallel
This chapter covers Steve Cook's “parallel complexity years.” It adopts an historical perspective: first, the context leading to his interest in the study ...
The parallel computation thesis is a hypothesis which states that the time used by a (reasonable) parallel machine is polynomially related to the space used by ...
In complexity theory parallel time is clearly a fundamental resource for synchronous parallel computation. However, study of parallel time complexity classes ...