Limits parallel computation p completeness von greenlaw raymond (6 Ergebnisse)

Zustand: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Zustand: As New. Unread book in perfect condition.

Zustand: New. This monograph focuses on one important topic of parallel computation: the complexity of problems that appear to be difficult to parallelize. The authors present in one reference all of the current definitions and research results in the area. Num Pages: 336 pages, line figures. BIC Classification: UYFP. Category: (P) Professional & Vocational. Dimension: 243 x 161 x 28. Weight in Grams: 601. . 1995. 1st Edition. hardcover. . . . . Books ship from the US and Ireland.…

Hardcover. Zustand: Brand New. 336 pages. 9.75x6.50x1.00 inches. In Stock.