Kniha Computability and Complexity Theory Homer

Computability and Complexity Theory

Autor: Homer
Jazyk: Angličtina
Väzba: Pevná
Dostupnosť: Skladom u dodávateľa
Odosielame za 10-13 dní
84.98
This revised and extensively expanded edition of Computability and Complexity Theory comprises essen...

Informácie o knihe

Autor
Jazyk
Angličtina
Väzba
Kniha - Pevná
Vydalo
2011
Stránok
300
EAN
9781461406815
ISBN
1461406811
Enbook ID
04429345
Hmotnosť
610
Rozmery
164 x 244 x 23

Kompletný popis

This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes:§a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp Lipton.a chapter studying properties of the fundamental probabilistic complexity classesa study of the alternating Turing machine and uniform circuit classes. an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Todaa thorough treatment of the proof that IP is identical to PSPACE With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential and practical learning tool.§Topics and features: §Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified mannerProvides key mathematical background information, including sections on logic and number theory and algebra Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes

Mohlo by vás zaujímať

45.23
35.32

Iliad

Homer
35.32

Odyssey

Homer
35.32
13.04

Odyssey

Homer
5.00

Iliad

Homer
17.56

Odyssey

Homer
18.34
16.18

Iliad

Homer
20.99

Iliad

Homer
4.41

Iliad

Homer
7.15

Iliad

Homer
10.49

Iliad

Homer
9.02
60.05
17.56

Iliad

Homer
10.69

Iliad

Homer
11.47

Odyssey

Homer
9.80
20.80

Odyssey

Homer
16.38

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

9.61
12.45

Roy Cohn

Philippe Corbé
28.06
68.30