Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
EUR 28,45
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Very Good. We are unable to ship to Canada at this time.Ex-library paperback in very nice condition with the usual markings and attachments.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 53,67
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: D2D Books, Berkshire, Reino Unido
EUR 38,55
Cantidad disponible: 1 disponibles
Añadir al carritoSoft cover. Condición: New. Springer-Verlag Berlin and Heidelberg GmbH & Co. K August 2001, 555 pages A BRAND NEW BOOK STILL IN UNOPENED CELLO WRAPPING. . Full refund if not satisfied. 24 hour despatch.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 57,55
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 83,46
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 1st edition. 542 pages. 9.50x6.25x1.25 inches. In Stock.
Publicado por Springer Berlin Heidelberg, 2001
ISBN 10: 3540424873 ISBN 13: 9783540424871
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - ThesymposiaonFundamentalsofComputationTheoryareheldeverytwoyears. Following the tradition established at the rst FCT 1977, the conference brings together specialists in theoretical elds of Computer Science from various co- tries and stimulates mathematical research in theoretical computer science. - pics of interest for the satellite workshop onE cientAlgorithms WEA2001 are: computational complexity, graph and network algorithms, ow and routing - gorithms,coloringandpartitioning,cutsandconnectivity,packingandcovering, scheduling algorithms, approximation algorithms, inapproximability results, - line problems, randomized algorithms, integer programming, semide nite p- gramming, algorithmic geometry, polyhedral combinatorics, branch and bound algorithms, cutting plane algorithms, and various applications. The 13th FCT was held in Riga-Lielupe, August 22-24, 2001 with an - ditional day (August 25) for the satellite workshop WEA2001. The previous meetings were held in the following cities: Poznan-K ornik, Poland, 1977 Wendish-Rietz, Germany, 1979 Szeged, Hungary, 1981 Borgholm, Sweden, 1983 Cottbus, Germany, 1985 Kazan, Russia, 1987 Szeged, Hungary, 1989 Gosen-Berlin, Germany, 1991 Szeged, Hungary, 1993 Dresden, Germany, 1995 Krak ow, Poland, 1997 Iasi, Romania, 1999 Thisyearthenumberofsubmittedpaperswashigh.TheProgramCommittee decided to accept 28 submissions as regular papers and 15 submissions as short papers. Additionally, the Program Committee of WEA2001 accepted 8 papers.
Librería: preigu, Osnabrück, Alemania
EUR 50,35
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Fundamentals of Computation Theory | 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings | Rusins Freivalds | Taschenbuch | xiv | Englisch | 2001 | Springer | EAN 9783540424871 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 111,29
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.