Электронная книга: Ko Ker-I «Theory of Computational Complexity»
|
Praise for the First Edition«…complete, up-to-date coverage of computational complexity theory…the book promises to become the standard reference on computational complexity.» -Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers’ feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problemsand the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as: A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science Additional exercises at varying levels of difficulty to further test comprehension of the presented material End-of-chapter literature reviews that summarize each topic and offer additional sources for further study Theory of Computational Complexity, Second Edition, is an excellent textbook for courses on computational theory and complexityat the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research. A thorough revision based on advances in the field of computational complexity and readers’feedback, the Second Edition of Theory of Computational Complexity presents updates to theprinciples and applications essential to understanding modern computational complexitytheory. The new edition continues to serve as a comprehensive resource on the use of softwareand computational approaches for solving algorithmic problems and the related difficulties thatcan be encountered.Maintaining extensive and detailed coverage, Theory of Computational Complexity, SecondEdition, examines the theory and methods behind complexity theory, such as computationalmodels, decision tree complexity, circuit complexity, and probabilistic complexity. The SecondEdition also features recent dev Издательство: "John Wiley&Sons Limited"
ISBN: 9781118593035 электронная книга Купить за 10068.11 руб и скачать на Litres |
Другие книги схожей тематики:
| Автор | Книга | Описание | Год | Цена | Тип книги |
|---|---|---|---|---|---|
| George Tourlakis | Theory of Computation | Learn the skills and acquire the intuition to assess the theoretical limitations of computer programming Offering an accessible approach to the topic, Theory of Computation focuses on the metatheory… — John Wiley&Sons Limited, электронная книга Подробнее... | 10302.26 | электронная книга | |
| Camelia Voinea Florela | Political Attitudes. Computational and Simulation Modelling | Political Science has traditionally employed empirical research and analytical resources to understand, explain and predict political phenomena. One of the long-standing criticisms against empirical… — John Wiley&Sons Limited, электронная книга Подробнее... | 5274.76 | электронная книга | |
| Wagner Kevin | Proportionate-type Normalized Least Mean Square Algorithms | The topic of this book is proportionate-type normalized least mean squares (PtNLMS) adaptive filtering algorithms, which attempt to estimate an unknown impulse response by adaptively giving gains… — John Wiley&Sons Limited, электронная книга Подробнее... | 7878.89 | электронная книга | |
| Benny Raphael | Engineering Informatics. Fundamentals of Computer-Aided Engineering, Second Edition | Computers are ubiquitous throughout all life-cycle stages of engineering, from conceptual design to manufacturing maintenance, repair and replacement. It is essential for all engineers to be aware of… — John Wiley&Sons Limited, электронная книга Подробнее... | 8725.33 | электронная книга | |
| Verbrugge Rineke | Teamwork in Multi-Agent Systems. A Formal Approach | What makes teamwork tick? Cooperation matters, in daily life and in complex applications. After all, many tasks need more than a single agent to be effectively performed. Therefore, teamwork rules… — John Wiley&Sons Limited, электронная книга Подробнее... | 8819.36 | электронная книга | |
| Zhong-Ping Jiang | Robust Adaptive Dynamic Programming | A comprehensive look at state-of-the-art ADP theory and real-world applications This book fills a gap in the literature by providing a theoretical framework for integrating techniques from adaptive… — John Wiley&Sons Limited, электронная книга Подробнее... | 8879.91 | электронная книга | |
| Stephen Bush F. | Smart Grid. Communication-Enabled Intelligence for the Electric Power Grid | This book bridges the divide between the fields of power systems engineering and computer communication through the new field of power system information theory. Written by an expert with vast… — John Wiley&Sons Limited, электронная книга Подробнее... | 9209.59 | электронная книга | |
| Robert Paknys | Applied Frequency-Domain Electromagnetics | Understanding electromagnetic wave theory is pivotal in the design of antennas, microwave circuits, radars, and imaging systems. Researchers behind technology advances in these and other areas need… — John Wiley&Sons Limited, электронная книга Подробнее... | 10810.32 | электронная книга | |
| Noga Alon | The Probabilistic Method | Praise for the Third Edition“Researchers of any kind of extremal combinatorics or theoretical computer science will welcome the new edition of this book.” – MAA Reviews Maintaining a standard… — John Wiley&Sons Limited, электронная книга Подробнее... | 8879.91 | электронная книга |
См. также в других словарях:
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Computational complexity of mathematical operations — The following tables list the running time of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine.[1] See big O notation for an explanation … Wikipedia
Computational Complexity — may refer to: Computational complexity theory Computational Complexity (journal) This disambiguation page lists articles associated with the same title. If an internal link led you here, you may wish to c … Wikipedia
Asymptotic computational complexity — In computational complexity theory, asymptotic computational complexity is the usage of the asymptotic analysis for the estimation of computational complexity of algorithms and computational problems, commonly associated with the usage of the big … Wikipedia
Context of computational complexity — In computational complexity theory and analysis of algorithms, a number of metrics are defined describing the resources, such as time or space, that a machine needs to solve a particular problem. Interpreting these metrics meaningfully requires… … Wikipedia
Theory of computation — In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata… … Wikipedia
