The complexity theory companion (Q5925718): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import recommendations run Q6534273
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Q3993545 / rank
 
Normal rank
Property / Recommended article: Q3993545 / qualifier
 
Similarity Score: 0.86536527
Amount0.86536527
Unit1
Property / Recommended article: Q3993545 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Mathematics and Computation / rank
 
Normal rank
Property / Recommended article: Mathematics and Computation / qualifier
 
Similarity Score: 0.8617101
Amount0.8617101
Unit1
Property / Recommended article: Mathematics and Computation / qualifier
 
Property / Recommended article
 
Property / Recommended article: Computational Complexity / rank
 
Normal rank
Property / Recommended article: Computational Complexity / qualifier
 
Similarity Score: 0.8612532
Amount0.8612532
Unit1
Property / Recommended article: Computational Complexity / qualifier
 
Property / Recommended article
 
Property / Recommended article: Computational Complexity / rank
 
Normal rank
Property / Recommended article: Computational Complexity / qualifier
 
Similarity Score: 0.8576193
Amount0.8576193
Unit1
Property / Recommended article: Computational Complexity / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4942157 / rank
 
Normal rank
Property / Recommended article: Q4942157 / qualifier
 
Similarity Score: 0.8483125
Amount0.8483125
Unit1
Property / Recommended article: Q4942157 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Confronting intractability via parameters / rank
 
Normal rank
Property / Recommended article: Confronting intractability via parameters / qualifier
 
Similarity Score: 0.84699786
Amount0.84699786
Unit1
Property / Recommended article: Confronting intractability via parameters / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4692882 / rank
 
Normal rank
Property / Recommended article: Q4692882 / qualifier
 
Similarity Score: 0.84376055
Amount0.84376055
Unit1
Property / Recommended article: Q4692882 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4298260 / rank
 
Normal rank
Property / Recommended article: Q4298260 / qualifier
 
Similarity Score: 0.8408342
Amount0.8408342
Unit1
Property / Recommended article: Q4298260 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3707408 / rank
 
Normal rank
Property / Recommended article: Q3707408 / qualifier
 
Similarity Score: 0.8397167
Amount0.8397167
Unit1
Property / Recommended article: Q3707408 / qualifier
 

Latest revision as of 20:54, 27 January 2025

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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references