NC (complexity): Decision Problem, Computational Complexity Theory, Polylogarithmic Time, Parallel Computing - Softcover
Search results for NC (complexity): Decision Problem, Computational Complexity...
Seller Image
NC (complexity)
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In complexity theory, the class NC (for 'Nick''s Class') is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In other words, a problem is in NC if there exist constants c and k such that it can be solved in time O(logc n) using O(nk) parallel processors. Stephen Cook coined the name 'Nick''s class' after Nick Pippenger, who had done extensive research on circuits with polylogarithmic depth and polynomial size. Just as the class P can be thought of as the tractable problems, so NC can be thought of as the problems that can be efficiently solved on a parallel computer. NC is a subset of P because polylogarithmic parallel computations can be simulated by polynomial-time sequential ones. 68 pp. Englisch. Seller Inventory # 9786130992835
Seller Image
NC (complexity) | Decision Problem, Computational Complexity Theory, Polylogarithmic Time, Parallel Computing
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. NC (complexity) | Decision Problem, Computational Complexity Theory, Polylogarithmic Time, Parallel Computing | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130992835 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Seller Inventory # 113262743
Seller Image
NC (complexity)
Print on DemandSeller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In complexitytheory, the class NC (for 'Nick's Class') is the set of decisionproblems decidable in polylogarithmic time on a parallel computer with apolynomial number of processors. In other words, a problem is in NC ifthere exist constants c and k such that it can be solved in time O(logcn) using O(nk) parallel processors. Stephen Cook coined the name 'Nick'sclass' after Nick Pippenger, who had done extensive research on circuitswith polylogarithmic depth and polynomial size. Just as the class P canbe thought of as the tractable problems, so NC can be thought of as theproblems that can be efficiently solved on a parallel computer. NC is asubset of P because polylogarithmic parallel computations can besimulated by polynomial-time sequential ones.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 68 pp. Englisch. Seller Inventory # 9786130992835