Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 7-14 Tagen versandfertig
Veröffentlichung:	August 2016
Genre:	Schulbücher
	Algorithm Analysis and Problem Complexity / Algorithms / Algorithms & data structures / B / Computation by Abstract Devices / computer science / Computers / Mathematical theory of computation / Mathematics and Statistics / Modeling / Theoretische Informatik / Theory of Computation mehr...
ISBN:	9781493938209
EAN-Code:	9781493938209
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	Theory and Applications of Computability
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	1329 gr
Seiten:	855
Illustration:	XXVIII, 855 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Computability and complexity theory are two central areas of research in theoretical computer science. Until recently, most work in these areas concentrated on problems over discrete structures, but there has been enormous growth of computability theory and complexity theory over the real numbers and other continuous structures, especially incorporating concepts of "randomness." This book provides a systematic, technical development of "algorithmic randomness" and complexity. It presents concepts and results for understanding relative randomness and its relation to computational complexity. These new results are important for addressing fundamental problems in computational geometry, modeling of dynamic systems, and classical problems in numerical computations.