Algorithms And Complexity,A, Unknown, Author

Автор: Barthelemy, Jean-Pierre.
Название: Algorithmic Complexity and Telecommunication Problems
ISBN: 1857284518 ISBN-13(EAN): 9781857284515
Издательство: Taylor&Francis
Рейтинг:
Цена: 79610.00 T
Наличие на складе: Нет в наличии.
Описание: In this treatment of algorithmic complexity the authors explore an area fundamental to the study of the foundations of computer science. It is a topic which is at the interface of information theory, applied mathematics and computer language theory and which is rooted strongly in this book in the problems of computer communication.; Complexity theory classifies problems according to the difficulty of resolving them, while algorithms provide the computational method for solving those problems. Therefore, algorithmic complexity is concerned with establishing the best algorithm given the constraints of the computational environment and the degree of complexity.; The first three chapters present the context for a later in-depth look at applied areas of the subject, with an outline of classical complexity theory. This is followed by three chapters which explore the key area of information communication. Within this field, the book is particularly concerned with two contiguous areas which make contrasting demands on the application of algorithmic complexity. Cryptography demands the creation of extremely complex problems in order to achieve its goal of security, whereas in coding for communication the emphasis is on maximizing the compact nature of the message and providing the error correction necessary for the message to achieve optimum speed. The two must co-exist and the methods outlined in Algorithmic Complexity suggest a number of approaches to such problems based on extensive examples of the authors' experience.; This senior undergraduate book should be an essential read for those studying advanced topics in theoretical computer science and should provide an introduction to applied complexity for researchers and professionals alike.

Автор: Miklos
Название: Computational Complexity
ISBN: 1138035572 ISBN-13(EAN): 9781138035577
Издательство: Taylor&Francis
Рейтинг:
Цена: 91860.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms.

Автор: Rosella Petreschi; Giuseppe Persiano; Riccardo Sil
Название: Algorithms and Complexity
ISBN: 3540401768 ISBN-13(EAN): 9783540401766
Издательство: Springer
Рейтинг:
Цена: 69870.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Giancarlo Bongiovanni; Daniel P. Bovet; Giuseppe D
Название: Algorithms and Complexity
ISBN: 3540625925 ISBN-13(EAN): 9783540625926
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This text constitutes the refereed proceedings of the Third Italian Conference on Algorithms and Complexity, CIAC`97, held in Rome, Italy in March 1997. The 25 revised full papers present an overview of current research activities and recent results in theory and applications of algorithms.

Автор: Miklos
Название: Computational Complexity of Counting and Sampling
ISBN: 1138070831 ISBN-13(EAN): 9781138070837
Издательство: Taylor&Francis
Рейтинг:
Цена: 214370.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms.

Автор: Jin-Yi Cai, Xi Chen
Название: Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain
ISBN: 1107062373 ISBN-13(EAN): 9781107062375
Издательство: Cambridge Academ
Рейтинг:
Цена: 155230.00 T
Наличие на складе: Невозможна поставка.
Описание: Complexity theory aims to understand and classify computational problems according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems on the Boolean domain and is broadly accessible to researchers and graduate students.

Автор: Yiannis N. Moschovakis
Название: Abstract Recursion and Intrinsic Complexity
ISBN: 110841558X ISBN-13(EAN): 9781108415583
Издательство: Cambridge Academ
Рейтинг:
Цена: 121440.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems.

Автор: Adele Kuzmiakova
Название: Computer Science, Algorithms and Complexity
ISBN: 1774077485 ISBN-13(EAN): 9781774077481
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 156150.00 T
Наличие на складе: Нет в наличии.
Описание: Defines complexity as a numerical function T (n) - the relationship between time and input size n, as one of the basic ideas of computer science. The computational complexity is categorized by algorithm based on its nature and function.

Автор: Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Название: Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives
ISBN: 1611976987 ISBN-13(EAN): 9781611976984
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 82770.00 T
Наличие на складе: Нет в наличии.
Описание: One of the most popular ways to assess the "effort" needed to solve a problem is to count how many evaluations of the problem functions (and their derivatives) are required. In many cases, this is often the dominating computational cost. Given an optimization problem satisfying reasonable assumptions—and given access to problem-function values and derivatives of various degrees—how many evaluations might be required to approximately solve the problem? Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives addresses this question for nonconvex optimization problems, those that may have local minimizers and appear most often in practice. This is the first bookon complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems,to address the disadvantages of traditional optimality measures and propose useful surrogates leading to algorithms that compute approximate high-order critical points, and to compare traditional and new methods, highlighting the advantages of the latter from a complexity point of view.This is the go-to book for those interested in solving nonconvex problems. It is suitable for advanced undergraduate and graduate students in courses on Advanced Numerical Analysis, Special Topics on Numerical Analysis, Topics on Data Science, Topics on Numerical Optimization, and Topics on Approximation Theory.

Автор: Tor Lattimore, Csaba Szepesvari
Название: Bandit Algorithms
ISBN: 1108486827 ISBN-13(EAN): 9781108486828
Издательство: Cambridge Academ
Рейтинг:
Цена: 46470.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Decision-making in the face of uncertainty is a challenge in machine learning, and the multi-armed bandit model is a common framework to address it. This comprehensive introduction is an excellent reference for established researchers and a resource for graduate students interested in exploring stochastic, adversarial and Bayesian frameworks.

Автор: Chambers
Название: Practical handbook of genetic algorithms vol.3
ISBN: 0849325390 ISBN-13(EAN): 9780849325397
Издательство: Taylor&Francis
Рейтинг:
Цена: 183750.00 T
Наличие на складе: Нет в наличии.
Описание: Contains computer-code examples for the development of genetic algorithm systems. This book describes specific functions of genetic algorithms.

Автор: Florentin Smarandache, Said Broumi
Название: Neutrosophic Graph Theory and Algorithms
ISBN: 1799813142 ISBN-13(EAN): 9781799813149
Издательство: Mare Nostrum (Eurospan)
Цена: 180180.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still yield ambiguous and imprecise results. In order to cut down on these indeterminate factors, neutrosophic logic has emerged as an applicable solution that is gaining significant attention in solving many real-life decision-making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. However, empirical research on this specific graph set is lacking. Neutrosophic Graph Theory and Algorithms is a collection of innovative research on the methods and applications of neutrosophic sets and logic within various fields including systems analysis, economics, and transportation. While highlighting topics including linear programming, decision-making methods, and homomorphism, this book is ideally designed for programmers, researchers, data scientists, mathematicians, designers, educators, researchers, academicians, and students seeking current research on the various methods and applications of graph theory.