The complexity theory companion (Q5925718): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / review text | |||
The book is intended for readers who seek an accessible, algorithmically oriented research-centered, up-to-date guide to several interesting techniques of computational complexity. In contrast to the organization of other books, each chapter of this book focuses on one particular technique in complexity theory. The technique is explained and the results achieved by it and its applications are presented. Each chapter is provided with bibliographic notes and a part containing open issues. The book is divided into the following chapters: 1. The self-reducibility technique; 2. The one-way function technique; 3. The tournament divide and conquer technique; 4. The isolation technique; 5. The witness reduction technique; 6. The polynomial interpolation technique; 7. The nonsolvable group technique; 8. The random restriction technique; 9. The polynomial technique. The book contains two appendices, the first presenting a concise overview on complexity classes, the second one on reductions. The book present a survey on a great variety of recent interesting techniques in complexity. It falls well into the long line of surveys or surveys-like monographs emphasizing the special field of computational complexity starting with Wagner's and Wechsung's monograph of the same name (Zbl 0584.68062). | |||
Property / review text: The book is intended for readers who seek an accessible, algorithmically oriented research-centered, up-to-date guide to several interesting techniques of computational complexity. In contrast to the organization of other books, each chapter of this book focuses on one particular technique in complexity theory. The technique is explained and the results achieved by it and its applications are presented. Each chapter is provided with bibliographic notes and a part containing open issues. The book is divided into the following chapters: 1. The self-reducibility technique; 2. The one-way function technique; 3. The tournament divide and conquer technique; 4. The isolation technique; 5. The witness reduction technique; 6. The polynomial interpolation technique; 7. The nonsolvable group technique; 8. The random restriction technique; 9. The polynomial technique. The book contains two appendices, the first presenting a concise overview on complexity classes, the second one on reductions. The book present a survey on a great variety of recent interesting techniques in complexity. It falls well into the long line of surveys or surveys-like monographs emphasizing the special field of computational complexity starting with Wagner's and Wechsung's monograph of the same name (Zbl 0584.68062). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ludwig Staiger / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:40, 4 March 2024
scientific article; zbMATH DE number 1566499
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity theory companion |
scientific article; zbMATH DE number 1566499 |
Statements
The complexity theory companion (English)
0 references
19 February 2001
0 references
computational complexity
0 references
algorithms
0 references
reducibility
0 references
The book is intended for readers who seek an accessible, algorithmically oriented research-centered, up-to-date guide to several interesting techniques of computational complexity. In contrast to the organization of other books, each chapter of this book focuses on one particular technique in complexity theory. The technique is explained and the results achieved by it and its applications are presented. Each chapter is provided with bibliographic notes and a part containing open issues. The book is divided into the following chapters: 1. The self-reducibility technique; 2. The one-way function technique; 3. The tournament divide and conquer technique; 4. The isolation technique; 5. The witness reduction technique; 6. The polynomial interpolation technique; 7. The nonsolvable group technique; 8. The random restriction technique; 9. The polynomial technique. The book contains two appendices, the first presenting a concise overview on complexity classes, the second one on reductions. The book present a survey on a great variety of recent interesting techniques in complexity. It falls well into the long line of surveys or surveys-like monographs emphasizing the special field of computational complexity starting with Wagner's and Wechsung's monograph of the same name (Zbl 0584.68062).
0 references