Refine Results
Sort By
From
To
Page 1
Page 1
Complexity Theory : Exploring the Limits of Efficient Algorithms
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
Advances in Information Processing and Protection
This book contains a selection of the best papers given at the international Advanced Computer Systems Conference in October 2006 in Miedzyzdroje, Poland. Combining research areas from both Computer Science and Industrial Management.
Logic Synthesis for Compositional Microprogram Control Units
In this book control algorithms are represented by the linear graph-schemes of algorithms (GSA), where the number of operator vertices is not less than 75% of the total number of all algorithm vertices. A special class of control units named as compositional microprogram control units (CMCU) is proposed as the best way for interpretation of linear control algorithms.
