| 書目名稱 | Pedigree Polytopes |
| 副標(biāo)題 | New Insights on Comp |
| 編輯 | Tirukkattuppalli Subramanyam Arthanari |
| 視頻video | http://file.papertrans.cn/744/743294/743294.mp4 |
| 概述 | Settles an important question in Mathematics, namely the millennium problem – NP vs P.Provides easily accessible proof for the same, with examples and figures even graduate students can grasp.Opens up |
| 圖書封面 |  |
| 描述 | .This book defines and studies a combinatorial object called the pedigree and develops the theory for optimising a linear function over the convex hull of pedigrees (the Pedigree polytope). A strongly polynomial algorithm implementing the framework given in the book for checking membership in the pedigree polytope is a major contribution..This book challenges the popularly held belief in computer science that a problem included in the?.NP-complete.?class may not have a polynomial algorithm to solve. By showing?.STSP.?has a polynomial algorithm, this book settles the?.P.?vs?.NP.?question..This book has illustrative examples, figures, and easily accessible proofs for showing this unexpected result. This book introduces novel constructions and ideas previously not used in the literature. Another interesting feature of this book is it uses basic max-flow and linear multicommodity flow algorithms and concepts in theseproofs establishing efficient membership checking for the pedigree polytope. Chapters 3-7 can be adopted to give a course on?.Efficient Combinatorial Optimization.. This book is the culmination of the author‘s research that started in 1982 through a presentation on a new fo |
| 出版日期 | Book 2023 |
| 關(guān)鍵詞 | Combinatorial Optimization; Pedigree Polytopes; Polynomial Time Algorithms; Computational Complexity; S |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-981-19-9952-9 |
| isbn_softcover | 978-981-19-9954-3 |
| isbn_ebook | 978-981-19-9952-9 |
| copyright | The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapor |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-11-2 12:32
發(fā)表于 2025-3-21 18:27:37
