Parallel complexity theory (7 résultats)

Etat : very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail.…

paperback. Etat : Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…

Taschenbuch. Etat : 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. …

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computationalcomplexity theory, the parallel computation thesis is a hypothesis whichstates that the time used by a (reasonable) parallel machine ispolynomially related to the space used by a sequential machine. Theparallel computation thesis was set forth by Chandra and Stockmeyer in1976 (see References).In other words, for a computational model whichallows computations to branch and run in parallel without bound, aformal language which is decidable under the model using no more thant(n) steps for inputs of length n is decidable by a machine in theunbranching model using no more than t(n)k units of storage for someconstant k. Similarly, if a machine in the unbranching model decides alanguage using no more than s(n) storage, a machine in the parallelmodel can decide the language in no more than s(n)k steps for someconstant k.…

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. H. T. Kung, b.November 9, 1945 is a computer scientist. His current research isprimarily in the area of communications networks and network securitybut his interests have been broad-ranging, including complexity theorydatabase theory, VLSI design, and parallel computing. He received hisbachelor degree from National Tsing Hua University in Taiwan and Ph.D.from Carnegie Mellon University, and first taught there, where hisresearch included work on novel parallel computers and thepopularization of the Systolic array.…

Taschenbuch. Etat : Neu. Computability | Computability theory, Computer science, Mathematical logic, Turing machine, Automata theory, Hypercomputation, Computational complexity theory, Parallel computing, Halting problem | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130205133 | 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.…