TY - BOOK ID - 5360497 TI - Complexity Theory : Exploring the Limits of Efficient Algorithms PY - 2005 SN - 3540210458 3642059147 3540274774 PB - Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, DB - UniCat KW - Algorithms. KW - Algorithmes KW - Algorithms KW - Computer Science KW - Mathematical Theory KW - Mathematics KW - Engineering & Applied Sciences KW - Physical Sciences & Mathematics KW - Constructive mathematics. KW - EPUB-LIV-FT LIVINFOR SPRINGER-B KW - Mathematics, Constructive KW - Algorism KW - Computer science. KW - Computer programming. KW - Coding theory. KW - Computer logic. KW - Mathematical logic. KW - Computer Science. KW - Programming Techniques. KW - Algorithm Analysis and Problem Complexity. KW - Coding and Information Theory. KW - Logics and Meanings of Programs. KW - Mathematical Logic and Formal Languages. KW - Algebra KW - Arithmetic KW - Foundations KW - Logic, Symbolic and mathematical KW - Computer software. KW - Logic design. KW - Data compression (Telecommunication) KW - Digital electronics KW - Information theory KW - Machine theory KW - Signal theory (Telecommunication) KW - Computer programming KW - Design, Logic KW - Design of logic systems KW - Electronic circuit design KW - Logic circuits KW - Switching theory KW - Software, Computer KW - Computer systems KW - Informatics KW - Science KW - Information theory. KW - Algebra of logic KW - Logic, Universal KW - Mathematical logic KW - Symbolic and mathematical logic KW - Symbolic logic KW - Algebra, Abstract KW - Metamathematics KW - Set theory KW - Syllogism KW - Computer science logic KW - Communication theory KW - Communication KW - Cybernetics KW - Computers KW - Electronic computer programming KW - Electronic data processing KW - Electronic digital computers KW - Programming (Electronic computers) KW - Coding theory KW - Programming KW - Logic, Symbolic and mathematical. UR - https://www.unicat.be/uniCat?func=search&query=sysid:5360497 AB - 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. ER -