Verlag: Stuttgart : Teubner, 1991
ISBN 10: 3519022486 ISBN 13: 9783519022480
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
Broschiert. Zustand: Gut. VIII, 239 S. ; Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber. Es befindet sich neben dem Rückenschild lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. Sprache: Deutsch Gewicht in Gramm: 410.
Verlag: Springer, 1987
ISBN 10: 3540137211 ISBN 13: 9783540137214
Anbieter: myVend, Altötting, Deutschland
Zustand: Used: Very Good. Inkl. Rechnung nach §19.
ISBN 10: 3934358454 ISBN 13: 9783934358454
Anbieter: medimops, Berlin, Deutschland
Zustand: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.
Verlag: Stuttgart : Teubner, 1992
ISBN 10: 3519122480 ISBN 13: 9783519122487
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
Broschiert. Zustand: Gut. 2., durchges. Aufl. VIII, 240 S. ; Das Buch befindet sich in einem ordentlich erhaltenen Zustand. Sprache: Deutsch Gewicht in Gramm: 410.
Anbieter: Antiquariat Renner OHG, Albstadt, Deutschland
Verbandsmitglied: BOEV
Verlag: Selbstverlag der Technischen Universität Dresden, Dresden,, 2000
ISBN 10: 3860052454 ISBN 13: 9783860052457
Anbieter: Antiquariat Christoph Wilde, Düsseldorf, Deutschland
267, (3) S. Orig.-Broschur. - Sehr guter Zustand innen und außen.
Verlag: Springer Berlin Heidelberg, 2013
ISBN 10: 3642631029 ISBN 13: 9783642631023
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Is the exponential function computable Are union and intersection of closed subsets of the real plane computable Are differentiation and integration computable operators Is zero finding for complex polynomials computable Is the Mandelbrot set decidable And in case of computability, what is the computational complexity Computable analysis supplies exact definitions for these and many other similar questions and tries to solve them. - Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text.
Verlag: Springer Berlin Heidelberg, 2011
ISBN 10: 3642699677 ISBN 13: 9783642699672
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Intends to lay a common basis for the different branches ofrecursion theory. Leads from the very basic theory to modernconcepts of computability. Consists of three consecutiveparts: 1. Basic Concepts of Computability. 2. TraditionalRecursion Theory. 3. Unified Type 2 theory of constructivityand computability on Baire's space including a general the-ory of representations.
Verlag: Springer Berlin Heidelberg, 2000
ISBN 10: 3540668179 ISBN 13: 9783540668176
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Is the exponential function computable Are union and intersection of closed subsets of the real plane computable Are differentiation and integration computable operators Is zero finding for complex polynomials computable Is the Mandelbrot set decidable And in case of computability, what is the computational complexity Computable analysis supplies exact definitions for these and many other similar questions and tries to solve them. - Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text.
Verlag: SAP PRESS Auflage: 1 (28. Dezember 2006), 2006
ISBN 10: 1592291066 ISBN 13: 9781592291069
Anbieter: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, Deutschland
Hardcover. Zustand: gut. Auflage: 1 (28. Dezember 2006). Industrial Operations Tasks Production Planning Control in mySAP ERP Organizational Structures Master Data Sales and Operations Planning Demand Management Material Requirements Planning Long-Term Planning Production Order Creation Capacity Requirements Planning Production Execution Supply Chain Management and Integration with SAP APO In englischer Sprache. 474 pages. 24,4 x 17,5 x 3 cm.