Van Leeuwen J. (ed.) Handbook of Theoretical Computer Science. Volume A. Algorithms and Complexity

формат djvu
размер 12.2 МБ
добавлен 11 мая 2011 г.

Издательсто Elsiever/MIT Press, 1990, -1010 pp.

Всеобъемлющий справочник о различных типах сложности алгоритмов и вычислений

Machine Models and Simulations
A Catalog of Complexity Classes
Machine-Independent Complexity Theory
Kolmogorov Complexity and its Applications
Data Structures
Computational Geometry
Algorithmic Motion Planning in Robotics
Average-Case Analysis of Algorithms and Data Structures
Graph Algorithms
Algorithms in Number Theory
Cryptography
The Complexity of Finite Functions
Communication Networks
VLSI Theory
Parallel Algorithms for Shared-Memory Machines
General Purpose Parallel Architectures

Похожие разделы

Смотрите также

Atallah M.J., Blanton M. (eds.) Algorithms and Theory of Computation Handbook. General Concepts and Techniques

Справочник

формат pdf
размер 8.46 МБ
добавлен 30 января 2012 г.

Издательство Chapman&Hall/CRC Press, 2010, -990 pp. The design and analysis of algorithms and data structures form the foundation of computer science. As current algorithms and data structures are improved and new methods are introduced, it becomes increasingly important to present the latest research and applications to professionals in the field. This series aims to capture new developments and applications in the design and analysis of al...

Atallah M.J., Blanton M. Algorithms and Theory of Computation Handbook: Special Topics and Techniques

формат pdf
размер 10.74 МБ
добавлен 22 августа 2011 г.

Chapman and Hall/CRC, 2009. - 950 pages. Algorithms and Theory of Computation Handbook, Second Edition: Special Topics and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems. Along with updating and revising many of the existing chapters, this second edition contains mo...

Cormen T.H. Introduction to algorithms

формат chm
размер 17.81 МБ
добавлен 12 июня 2009 г.

This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor.Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are...

Geddes K., Czapor S., Labahn G. Algorithms for Computer Algebra

формат djvu
размер 4.69 МБ
добавлен 04 января 2011 г.

Kluwer Academic Publishers, 1992. - 585 pages. Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divis...

Goldreich O. P, NP, and NP-Completeness. The Basics of Computational Complexity

формат pdf
размер 1.11 МБ
добавлен 31 октября 2011 г.

Издательство Cambridge University Press, 2010, -216 pp. The quest for efficiency is ancient and universal, as time and other resources are always in shortage. Thus, the question of which tasks can be performed efficiently is central to the human experience. A key step toward the systematic study of the aforementioned question is a rigorous definition of the notion of a task and of procedures for solving tasks. These definitions were provided by...

Greene D.H., Knuth D.E. Mathematics for the Analysis of Algorithms

формат djvu
размер 633.5 КБ
добавлен 20 марта 2011 г.

Birkhauser, 1981. - 107 pages. A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficul...

Kannan R., Vempala S. Spectral Algorithms

формат pdf
размер 566.5 КБ
добавлен 07 октября 2011 г.

Из серии Foundations and Trends in Theoretical Computer Science издательства NOWPress, 2009, -110 pp. Spectral methods refer to the use of eigenvalues, eigenvectors, singular values, and singular vectors. They are widely used in Engineering, Applied Mathematics, and Statistics. More recently, spectral methods have found numerous applications in Computer Science to discrete as well as continuous problems. This monograph describes modern applicati...

Lee T., Shraibman A. Lower Bounds in Communication Complexity: A Survey

формат pdf
размер 943.48 КБ
добавлен 07 октября 2011 г.

Из серии Foundations and Trends in Theoretical Computer Science издательства NOWPress, 2009, -127 pp. We survey lower bounds in communication complexity. Our focus is on lower bounds that work by first representing the communication complexity measure in Euclidean space. That is to say, the first step in these lower bound techniques is to find a geometric complexity measure such as rank, or the trace norm that serves as a lower bound to the unde...

Mayr E.W., Pr?mel H.J., Steger A. (eds.) Lectures on Proof Verification and Approximation Algorithms

формат pdf
размер 5.17 МБ
добавлен 08 декабря 2011 г.

Издательство Springer, 1998, -337 pp. Proof Verification and Approximation Algorithms - Hardly any area in theoretical computer science has been more lively and flourishing during the last few years. Different lines of research which had been developed independently of each other over the years culminated in a new and unexpected characterization of the well-known complexity class NP, based on probabilistically checking certain kinds of proofs. T...

Wegener I. Complexity Theory. Exploring the Limits of Efficient Algorithms

формат pdf
размер 2.31 МБ
добавлен 20 сентября 2011 г.

Издательство Springer, 2005, -306 pp. Complexity theory – is it a discipline for theoreticians who have no concern for the real world or a central topic of modern computer science? In this introductory text, complexity theory is presented as an active area of computer science with results that have implications for the development and use of algorithms. Our study will lead to insights into the structure of important optimization problems and wil...