Ergebnisse für: np-completeness
Hier findest Du Bücher, die sich mit np-completeness beschäftigen.
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 mo...
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 ped...
This book constitutes the refereed proceedings of the 7th Conference on Computability in Europe, CiE 2011, held in Sofia, Bulgaria, in June/July 2011. The 22 revised papers presented together with 11 invited lectures were carefully reviewed and selected with an acceptance rate of under 40%.
The pape...
This book constitutes the refereed proceedings of the 19th International Conference on Algorithmic Aspects in Information and Management, AAIM 2025, held in Ulaanbaatar, Mongolia, during June 23–25, 2025.
The 14 full papers included in this book were carefully reviewed and selected from ...
This book
constitutes revised selected papers from the International Conference on
Membrane Computing, CMC 2015, held in Valencia, Spain, in August 2015.The 22 full
papers presented in this volume were carefully reviewed and selected from 34
submissions. The volume also contains 3 invited talks in f...
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 ped...
This book constitutes the thoroughly refereed post-conference proceedings of the 15th International Conference on Membrane Computing, CMC 2014, held in Prague, Czech Republic, in August 2014. The 19 revised selected papers presented together with 5 invited lectures were carefully reviewed and select...
This book constitutes the
refereed proceedings of the 18th International Conference on Integer
Programming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgium,
in June 2016. The 33 full papers presented were carefully reviewed and selected
from 125 submissions. The conference is a for...
This textbook covers a diversity of topics in graph and network theory, both from a theoretical standpoint, and from an applied modelling point of view. Mathematica® is used to demonstrate much of the modelling aspects. Graph theory and model building tools are developed in tandem with effective te...
Cryptography lies at the heart of most technologies deployed today for secure communications. At the same time, mathematics lies at the heart of cryptography, as cryptographic constructions are based on algebraic scenarios ruled by group or number theoretical laws. Understanding the involved algebra...
This book constitutes the
refereed proceedings of the 18th International Conference on Integer
Programming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgium,
in June 2016. The 33 full papers presented were carefully reviewed and selected
from 125 submissions. The conference is a for...
This book constitutes the proceedings of the 10th International Workshop on Frontiers in Algorithmics, FAW 2016, held in Qingdao, China, in June/July 2016.      
The 25 full papers presented in this volume were carefully reviewed and selected from 54 submissions. They deal with algor...
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 mo...
On May 1, 2004, the world of theoretical computer science su?ered a stunning loss: Shimon Even passed away. Few computer scientists have had as long, s- tained, and in?uential a career as Shimon. Shimon Even was born in Tel-Aviv in 1935. He received a B.Sc. in Elect- cal Engineering from the Technio...
One of the most important and successful theories in computational complex ity is that of NP-completeness. This discrete theory is based on the Turing machine model and achieves a classification of discrete computational prob lems according to their algorithmic difficulty. Turing machines formalize ...
The book collects results about realization spaces of polytopes. It gives a presentation of the author's "Universality Theorem for 4-polytopes". It is a comprehensive survey of the important results that have been obtained in that direction. The approaches chosen are direct and very geometric in nat...