Berechenbarkeit Komplexität Logik (eBook)

Geben Sie eine Produktbewertung ab.

Algorithmen, Sprachen und Kalküle unter besonderer Berücksichtigung ihrer Komplexität

Autor: Egon Börger

CHF 47.70

ISBN: 978-3-322-83227-6

Einband: PDF

Verfügbarkeit: Download, sofort verfügbar (Link per E-Mail)

Menge:

+ -

Endlich liegt der ,,Klassiker" der Theoretischen Informatik, der Studenten und Forschern ein unentbehrliches Standardwerk ist, in neuer Auflage vor.

Autor	Börger, Egon
Verlag	Vieweg+Teubner Verlag
Einband	PDF
Erscheinungsjahr	2013
Seitenangabe	499 S.
Ausgabekennzeichen	Deutsch
Abbildungen	XX, 499 S.
Auflage	3., verb. und erweiterte Aufl. 1992

Über den Autor Egon Börger

Egon Boerger has worked since 1972 as professor of computer science at the Universities of Salerno, Muenster, Dortmund, Udine and Pisa (since 1985). He spent sabbatical years with IBM, Siemens, Microsoft, SAP and ETH Zürich. He is the author of seven books on logic, computer science and modeling business processes. In 2007 he received the Humboldt Research Award for his work in logic and computer science. His current interest is in rigorous design and analysis methods for concurrent software-intensive systems. Vincenzo Gervasi is an Associate Professor with the Computer Science Department of the University of Pisa, Italy. His main research interests lie in the cognitive aspects of the construction and comprehension of software. His current work areas include requirements engineering, software engineering, formal specifications, natural language processing, distributed algorithms and applications, and AI for biomedical applications. On these subjects he has published over 120 contributions in international venues. He is a member of IFIP WG 2.9 (Requirements Engineering).