عنوان
پدید آورنده
موضوع
رده
QA267.7 .D8 2014eb
QA267
.
7
.
D8
2014eb
کتابخانه
محل استقرار
شابک
شابک
1118593030
شابک
1118594975
شابک
1118595092
شابک
9781118593035
شابک
9781118594971
شابک
9781118595091
شابک اشتباه
1118306082
شابک اشتباه
9781118306086
شماره کتابشناسی ملی
شماره
dltt
عنوان و نام پديدآور
عنوان اصلي
Theory of computational complexity /
نام عام مواد
[Book]
نام نخستين پديدآور
Ding-Zhu Du, Department of Computer Science, University of Texas at Dallas, Ann Arbor, MI, Ker-I Ko, Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY
وضعیت ویراست
وضعيت ويراست
Second edition
مشخصات ظاهری
نام خاص و کميت اثر
1 online resource (xv, 494 pages)
فروست
عنوان فروست
Wiley Series in Discrete Mathematics and Optimization
يادداشت کلی
متن يادداشت
Historical Notes
یادداشتهای مربوط به کتابنامه ، واژه نامه و نمایه های داخل اثر
متن يادداشت
Includes bibliographical references and index
یادداشتهای مربوط به مندرجات
متن يادداشت
Cover; Title Page; Contents; Preface; Notes on the Second Edition; Part I Uniform Complexity; Chapter 1 Models of Computation and Complexity Classes; 1.1 Strings, Coding, and Boolean Functions; 1.2 Deterministic Turing Machines; 1.3 Nondeterministic Turing Machines; 1.4 Complexity Classes; 1.5 Universal Turing Machine; 1.6 Diagonalization; 1.7 Simulation; Exercises; Historical Notes; Chapter 2 NP-Completeness; 2.1 NP; 2.2 Cook's Theorem; 2.3 More NP-Complete Problems; 2.4 Polynomial-Time Turing Reducibility; 2.5 NP-Complete Optimization Problems; Exercises; Historical Notes
متن يادداشت
8.8 Relativized Probabilistic Complexity ClassesExercises; Historical Notes; Chapter 9 Complexity of Counting; 9.1 Counting Class #P; 9.2 #P-Complete Problems; 9.3 oplus P and the Polynomial-Time Hierarchy; 9.4 #P and the Polynomial-Time Hierarchy; 9.5 Circuit Complexity and Relativized oplus P and #P; 9.6 Relativized Polynomial-Time Hierarchy; Exercises; Historical Notes; Chapter 10 Interactive Proof Systems; 10.1 Examples and Definitions; 10.2 Arthur-Merlin Proof Systems; 10.3 AM Hierarchy Versus Polynomial-Time Hierarchy; 10.4 IP Versus AM; 10.5 IP Versus PSPACE; Exercises
متن يادداشت
Chapter 3 The Polynomial-Time Hierarchy and Polynomial Space3.1 Nondeterministic Oracle Turing Machines; 3.2 Polynomial-Time Hierarchy; 3.3 Complete Problems in PH; 3.4 Alternating Turing Machines; 3.5 PSPACE-Complete Problems; 3.6 EXP-Complete Problems; Exercises; Historical Notes; Chapter 4 Structure of NP; 4.1 Incomplete Problems in NP; 4.2 One-Way Functions and Cryptography; 4.3 Relativization; 4.4 Unrelativizable Proof Techniques; 4.5 Independence Results; 4.6 Positive Relativization; 4.7 Random Oracles; 4.8 Structure of Relativized NP; Exercises; Historical Notes
متن يادداشت
Chapter 7 Polynomial-Time Isomorphism7.1 Polynomial-Time Isomorphism; 7.2 Paddability; 7.3 Density of NP-Complete Sets; 7.4 Density of EXP-Complete Sets; 7.5 One-Way Functions and Isomorphism in EXP; 7.6 Density of P-Complete Sets; Exercises; Historical Notes; Part III Probabilistic Complexity; Chapter 8 Probabilistic Machines and Complexity Classes; 8.1 Randomized Algorithms; 8.2 Probabilistic Turing Machines; 8.3 Time Complexity of Probabilistic Turing Machines; 8.4 Probabilistic Machines with Bounded Errors; 8.5 BPP and P; 8.6 BPP and NP; 8.7 BPP and the Polynomial-Time Hierarchy
متن يادداشت
Part II Nonuniform ComplexityChapter 5 Decision Trees; 5.1 Graphs and Decision Trees; 5.2 Examples; 5.3 Algebraic Criterion; 5.4 Monotone Graph Properties; 5.5 Topological Criterion; 5.6 Applications of the Fixed Point Theorems; 5.7 Applications of Permutation Groups; 5.8 Randomized Decision Trees; 5.9 Branching Programs; Exercises; Historical Notes; Chapter 6 Circuit Complexity; 6.1 Boolean Circuits; 6.2 Polynomial-Size Circuits; 6.3 Monotone Circuits; 6.4 Circuits with Modulo Gates; 6.5 NC; 6.6 Parity Function; 6.7 P-Completeness; 6.8 Random Circuits and RNC; Exercises; Historical Notes
بدون عنوان
0
بدون عنوان
8
بدون عنوان
8
بدون عنوان
8
بدون عنوان
8
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
Praise for the First Edition "" ... complete, up-to-date coverage of computational complexity theory ... the book promises to become the standard reference on computational complexity.""--Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of
یادداشتهای مربوط به سفارشات
منبع سفارش / آدرس اشتراک
Safari Books Online
شماره انبار
CL0500000480
ویراست دیگر از اثر در قالب دیگر رسانه
عنوان
Theory of computational complexity.
شماره استاندارد بين المللي کتاب و موسيقي
9781118306086
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Computational complexity.
مقوله موضوعی
موضوع مستند نشده
MAT-- 000000
رده بندی ديویی
شماره
511
.
3/52
ويراست
23
رده بندی کنگره
شماره رده
QA267
.
7
نشانه اثر
.
D8
2014eb
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )
مستند نام اشخاص تاييد نشده
Du, Dingzhu
نام شخص - (مسئولیت معنوی برابر )
مستند نام اشخاص تاييد نشده
Ko, Ker-I
نام تنالگان _ (مسئولیت معنوی برابر)
مستند نام تنالگان تاييد نشده
Ohio Library and Information Network.
مبدا اصلی
تاريخ عمليات
20141125090444.0
قواعد فهرست نويسي ( بخش توصيفي )
pn
دسترسی و محل الکترونیکی
نام الکترونيکي
مطالعه متن کتاب اطلاعات رکورد کتابشناسی
نوع ماده
[Book]
اطلاعات دسترسی رکورد
تكميل شده
Y
