Книга Computability and Complexity Theory Homer

Computability and Complexity Theory

Автор: Homer
Език: Английски език
Корици: С твърди корици
Наличност: Външен склад
Изпращаме след 10-13 дни
89.46 174.96 лв
This revised and extensively expanded edition of Computability and Complexity Theory comprises essen...

Информация за книгата

Автор
Език
Английски език
Корици
Книга - С твърди корици
Издадена
2011
страници
300
EAN
9781461406815
ISBN
1461406811
Enbook ID
04429345
Теглоt
610
Размери
164 x 244 x 23

Пълно описание

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

Може също да ви хареса

47.46 92.82 лв
36.98 72.33 лв

Iliad

Homer
36.98 72.33 лв

Odyssey

Homer
36.98 72.33 лв
6.86 13.42 лв
13.83 27.04 лв

Odyssey

Homer
5.76 11.26 лв

Iliad

Homer
18.69 36.55 лв

Odyssey

Homer
19.39 37.92 лв
17.09 33.42 лв

Iliad

Homer
22.05 43.12 лв

Iliad

Homer
5.06 9.89 лв

Iliad

Homer
8.06 15.77 лв

Iliad

Homer
11.17 21.85 лв

Iliad

Homer
9.62 18.81 лв
62.69 122.62 лв
18.69 36.55 лв

Iliad

Homer
13.08 25.57 лв
18.84 36.85 лв

Iliad

Homer
12.27 24.01 лв

Odyssey

Homer
9.47 18.52 лв
22.05 43.12 лв

Odyssey

Homer
18.04 35.28 лв

Клиенти, които купиха тази книга, купиха също

3.25 6.36 лв
10.27 20.08 лв
13.03 25.48 лв

Roy Cohn

Philippe Corbé
29.26 57.24 лв
17.04 33.32 лв
74.67 146.04 лв
19.29 37.73 лв