Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Mai 2012
Genre:	Schulbücher
	Algorithm Analysis and Problem Complexity / Algorithms / C / Computation by Abstract Devices / Computer architecture & logic design / Computer logic / Computer programming / software engineering / computer science / Computer science—Mathematics / Computers / Discrete Mathematics / Discrete Mathematics in Computer Science / Logics and Meanings of Programs / Mathematical logic / Mathematical Logic and Formal Languages / Mathematical Logic and Foundations / Mathematical theory of computation / Maths for computer scientists / Theory of Computation mehr...
ISBN:	9783642308901
EAN-Code:	9783642308901
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#7370 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	801 gr
Seiten:	506
Illustration:	XXII, 506 p. 32 illus., schwarz-weiss Illustrationen
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschrift has been published in honor of Mike Fellows on the occasion of his 60th birthday. It contains 20 papers that showcase the important scientific contributions of this remarkable man, describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows's unique and broad range of interests, including his work on the popularization of discrete mathematics for young children. The volume contains several surveys that introduce the reader to the field of parameterized complexity and discuss important notions, results, and developments in this field.