Is it possible to prove that an efficient parallel algorithm can find an efficient sequential algo for same problem... (using a polynomial number of processors and taking polylogarithmic amount of time) ??
asifrahman 0 Newbie Poster
Rashakil Fol 978 Super Senior Demiposter Team Colleague
Isn't this an open problem? The question of whether NC = P or not is unsolved. See http://en.wikipedia.org/wiki/P-complete for more details.
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.