%{search_type} search results

11,218 catalog results

RSS feed for this result
Book
101 p. : ill. ; 19 cm.
SAL3 (off-campus storage)
Book
xvi, 513 p. : ill.
dx.doi.org SpringerLink
Book
xi, 308 p. : ill. ; 24 cm.
  • Introduction.- Algorithmic Problems and Their Complexity.- Fundamental Complexity Classes.- Reductions - Algorithmic Relations Between Problems.- The Theory of NP-Completeness.- NP-Complete and NP-Equivalent Problems.- The Complexity Analysis'of Problems.- The Complexity of Approximation Problems - Classical Results.- The Complexity of Black-Box Problems.- Further Complexity Classes and Relations between the Complexity Classes.- Interactive Proof Systems.- The PCP-Theorem and the Complexity of Approximation Problems.- Classical Subjects of Complexity Theory.- The Complexity of Nonuniform Problems.- Communication Complexity.- The Complexity of Boolean Function.- Conclusions.- Appendix: The O-notation-- Results from Probability Theory.- References.- Index.
  • (source: Nielsen Book Data)9783540210450 20160528
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.
(source: Nielsen Book Data)9783540210450 20160528
Book
19 p. ; 28 cm.
SAL3 (off-campus storage)
Book
21 p. : ill ; 28 cm.
SAL3 (off-campus storage)
Book
31 p. : ill. ; 28 cm.
SAL3 (off-campus storage)
Book
11 p. : ill. ; 28 cm.
SAL3 (off-campus storage)
Book
28 p. ; 28 cm.
SAL3 (off-campus storage)
Book
15 p. : ill. ; 28 cm
SAL3 (off-campus storage)
Book
xvi, 621 p. : ill. ; 24 cm.
Green Library, Science Library (Li and Ma)
Book
xii, 269 p. : ill. ; 25 cm.
  • Part 1: Fundamental Discoveries of the General Theory of Algorithms. Part 2: Mathematical Applications of the Theory of Algorithms. Appendix: Probabilistic Algorithms (How the Use of Randomness makes Computations Shorter).
  • (source: Nielsen Book Data)9780792322108 20160528
The theory of algorithms not only answers philosophical questions but also is eminently applicable to practical computing, as well as to software and hardware design. This book presents exact mathematical formulations of major concepts and facts of the theory of algorithms in a unified and elegant way. Precise mathematical statements are given, together with their underlying motivations, philosophical interpretations and historical developments, starting with Frege, Hilbert and Borel through Godel and Turing up to Kolmogorov's results of 1950-1980. This book is divided into two parts. The first part outlines the fundamental discoveries of the general theory of algorithms. Numerous applications are discussed in the second part. The concept of probabilistic algorithms is presented in the Appendix. This work will be of interest to mathematicians, computer scientists, engineers and to everyone who uses algorithms.
(source: Nielsen Book Data)9780792322108 20160528
Science Library (Li and Ma)
Book
1 v.
Green Library
Book
1 v.
Green Library
Book
1 v.
Green Library
Book
1 v.
Green Library
Book
1 v.
Green Library
Book
1 v.
Green Library
Book
1 v.
Green Library
Book
1 v.
Green Library
Book
1 v .
Green Library

Articles+

Journal articles, e-books, & other e-resources
Articles+ results include