dexter kozen (157 résultats)

Hardcover. Etat : As New. No Jacket. Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less 1.44.

Hardcover. Etat : Good. GOOD hardcover, 15 pages have some underlining / other marks, rest of text clean. Book.

Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Sprache: Englisch Gewicht in Gramm: 990.

Etat : Good. Ships from the UK. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.

.- Berlín Heidelberg New York. 1982. Springer - Verlag. 4º menor. VI- 429 pgs. Rústica editorial . Firma anterior poseedor. Muy buen estado. . . ISBN 10: 354011212X. Informática.

Etat : Sehr gut. Zustand: Sehr gut | Sprache: Deutsch | Produktart: Bücher.

Hardcover. Etat : Sehr gut. Cambridge, MIT (2000). gr.8°. XV, 459 p. Cloth. with dust jacket. With exercises.- Name on flyleaves, name and pencil annotation on title, otherwise in very good condition.

Hardcover. Etat : Near Fine. Hardcover 2004 edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Covers and text in near fine condition. {399 pages}.

Etat : New. In.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the31st International Workshop on Logic, Language, Information, and Computation, WoLLIC 2025, in Porto, Portugal, during July 2025.The 21 full papers included in this book were carefully reviewed and selected from 57 submissions. The WoLLIC conference aim of fostering interdisciplinary research in pure and applied logic.

Etat : New. SUPER FAST SHIPPING.

Etat : New.

Hardcover. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.95.

Etat : New. In.

Hardcover. Etat : Fine. 2nd Printing. Large octavo with grey boards and red text; x, 320 pages: illustrations; index; 25 cm. "These are my lecture notes from CS681: Design and Analysis of Algorithms, a one-semester graduate course I taught at Cornell for three consec? utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts ? A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. ? M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. ? R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references"--Preface by the author. Contents: I Lectures. 1 Algorithms and Their Complexity. 2 Topological Sort and MST. 3 Matroids and Independence. 4 Depth-First and Breadth-First Search. 5 Shortest Paths and Transitive Closure. 6 Kleene Algebra. 7 More on Kleene Algebra. 8 Binomial Heaps. 9 Fibonacci Heaps. 10 Union-Find. 11 Analysis of Union-Find. 12 Splay Trees. 13 Random Search Trees. 14 Planar and Plane Graphs. 15 The Planar Separator Theorem. 16 Max Flow. 17 More on Max Flow. 18 Still More on Max Flow. 19 Matching. 20 More on Matching. 21 Reductions and NP-Completeness. 22 More on Reductions and NP-Completeness. 23 More NP-Complete Problems. 24 Still More NP-Complete Problems. 25 Cook's Theorem. 26 Counting Problems and #P. 27 Counting Bipartite Matchings. 28 Parallel Algorithms and NC. 29 Hypercubes and the Gray Representation. 30 Integer Arithmetic in NC. 31 Csanky's Algorithm. 32 Chistov's Algorithm. 33 Matrix Rank. 34 Linear Equations and Polynomial GCDs. 35 The Fast Fourier Transform (FFT). 36 Luby's Algorithm. 37 Analysis of Luby's Algorithm. 38 Miller's Primality Test. 39 Analysis of Miller's Primality Test. 40 Probabilistic Tests with Polynomials. II Homework Exercises. Homework 1. Homework 2. Homework 3. Homework 4. Homework 5. Homework 6. Homework 7. Homework 8. Homework 9. Homework 10. Miscellaneous Exercises. III Homework Solutions. Homework 1 Solutions. Homework 2 Solutions. Homework 3 Solutions. Homework 4 Solutions. Homework 5 Solutions. Homework 6 Solutions. Homework 7 Solutions. Homework 8 Solutions. Homework 9 Solutions. Homework 10 Solutions. Solutions to Miscellaneous Exercises. Fine with faint external wear. Crisp and clean within.

Format groß 8°, kartoniert, 320 Seiten, dies ist ein regulär ausgesondertes Bibliotheksexemplar aus einer wissenschaftlichen Bibliothek, keine Markierungen / Anmerkungen, das Buch befindet sich in einem tadellosen Zustand --- Hardcover, Lib.Ex., no marks, 320 pages, good condition. Shipping to abroad insured with tracking number.