Kniha Computability and Complexity Theory Homer

Computability and Complexity Theory

Autor: Homer
Jazyk: Angličtina
Vazba: Pevná
Dostupnost: Skladem u dodavatele
Odesíláme za 10-13 dnů
1 944
This revised and extensively expanded edition of Computability and Complexity Theory comprises essen...

Informace o knize

Autor
Jazyk
Angličtina
Vazba
Kniha - Pevná
Vydáno
2011
Stránek
300
EAN
9781461406815
ISBN
1461406811
Enbook ID
04429345
Hmotnost
610
Rozměry
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 zajímat

1 041
811

Iliad

Homer
811

Odyssey

Homer
811
294

Odyssey

Homer
113

Iliad

Homer
397

Odyssey

Homer
417
371

Iliad

Homer
481

Iliad

Homer
107

Iliad

Homer
174

Iliad

Homer
237

Iliad

Homer
218
1 387

Iliad

Homer
241

Iliad

Homer
241

Odyssey

Homer
200
472

Odyssey

Homer
381

Zákaznicí kteří koupili tuto knihu koupili také

220
302

Roy Cohn

Philippe Corbé
591
1 653