Ker I Ko (85 results)

Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Ed. North-Holland, Amsterdam - 1986, in-8, broché, 104 pages (table des matières sur la photo) Bon état - Pour les envois hors de France, la tafication «livre & brochure» pour les frais de port a disparue.Les frais de port annoncés correspondent à une moyenne. Ils seront calculés au plus juste en fonction du poids de votre article.…

hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

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

Hardcover. Condition: Near Fine. 491pp. A Near Fine copy with pristine text, no inscriptions or labels, no wear to binding and glazed board covers displaying just light surface wear only. Please see five pictures attached.

Condition: 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.…

Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Gebundene Ausgabe. Condition: Sehr gut. 432 Seiten Auflage 1997,alles fast wie neu. Sprache: Englisch Gewicht in Gramm: 886.

Hardcover. Condition: Sehr gut. Boston, Birkhäuser 1991. gr.8°. VII, 309 p. Hardbound. Progress in Theoretical Computer Science.- Name on flyleaf, otherwise like new.

Cloth. Condition: Very Good. Dust Jacket Condition: No d/j as Published. Type: Book Small plain label inside cover.

Condition: New. pp. 454.

Condition: New. pp. 454 Index.

Hardcover. Condition: Brand New. 440 pages. 9.25x6.25x1.25 inches. In Stock.

Hardcover. Condition: New. 1st Edition. NEW BOOK.

Condition: New. In.

Hardcover. Condition: Near Fine. 491 pages in excellent condition. Green, glossy hardcovers with grey titles. Almost no wear. NEAR FINE. Book.

Condition: New. pp. 324.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New. In English.

Condition: Sehr gut. 1. Auflage. XIII, 491 Seiten, Zust: Gutes Exemplar. Mit Vorbesitzereintrag. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 848 gebundene Ausgabe gebundene Ausgabe.…

Condition: New.

Condition: Hervorragend. Zustand: Hervorragend | Seiten: 452 | Sprache: Englisch | Produktart: Bücher | This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way.…

Softcover. 226 p. Good condition. The pages are clean and without markings. Slight signs of storage and use. Retired library copy with corresponding markings. Book block slightly deformed. Otherwise, a neat copy. 9780273087557 Sprache: Englisch Gewicht in Gramm: 1000.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: New. In shrink wrap. Looks like an interesting title.

Condition: New. pp. 512.

Hardback. Condition: New. Praise for the First Edition ". complete, up-to-date coverage of computational complexity theory.the book promises to become the standard reference on computational complexity."-Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as: A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer scienceAdditional exercises at varying levels of difficulty to further test comprehension of the presented materialEnd-of-chapter literature reviews that summarize each topic and offer additional sources for further study  Theory of Computational Complexity, Second Edition, is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research.…