Computer Science, Algorithms and Complexity, Adele Kuzmiakova
Автор: Arora, Sanjeev Barak, Boaz Название: Computational complexity ISBN: 0521424267 ISBN-13(EAN): 9780521424264 Издательство: Cambridge Academ Рейтинг: Цена: 9029.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included.
Автор: Barthelemy, Jean-Pierre. Название: Algorithmic Complexity and Telecommunication Problems ISBN: 1857284518 ISBN-13(EAN): 9781857284515 Издательство: Taylor&Francis Рейтинг: Цена: 11942.00 р. Наличие на складе: Нет в наличии.
Описание: 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.
Автор: Tor Lattimore, Csaba Szepesvari Название: Bandit Algorithms ISBN: 1108486827 ISBN-13(EAN): 9781108486828 Издательство: Cambridge Academ Рейтинг: Цена: 6970.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Liao Heng Название: Mathematics for Future Computing and Communications ISBN: 1316513580 ISBN-13(EAN): 9781316513583 Издательство: Cambridge Academ Рейтинг: Цена: 8554.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: New mathematical ideas go hand-in-hand with innovation in computing, communications and AI. Such innovations are described here in a book that provides a panorama of ideas and applications in computer architecture, software verification, quantum computing, compressed sensing, Bayesian inference, machine learning, reinforcement learning and more.
Автор: Yiannis N. Moschovakis Название: Abstract Recursion and Intrinsic Complexity ISBN: 110841558X ISBN-13(EAN): 9781108415583 Издательство: Cambridge Academ Рейтинг: Цена: 18216.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Описание: 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.
Автор: Unknown, Author Название: Algorithms And Complexity,A ISBN: 0444880712 ISBN-13(EAN): 9780444880710 Издательство: Elsevier Science Рейтинг: Цена: 8420.00 р. Наличие на складе: Нет в наличии.
Описание: This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.
Автор: von zur Gathen Название: Modern Computer Algebra ISBN: 1107039037 ISBN-13(EAN): 9781107039032 Издательство: Cambridge Academ Рейтинг: Цена: 17582.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students, this textbook is widely regarded as the `bible of computer algebra`. Its comprehensiveness and reliability also makes it an essential reference for professionals. This updated edition includes an overview of recent improvements in areas like primality testing.
Описание: This book constitutes the thoroughly refereed post-conference proceedings of the International Dagstuhl-Seminar on Efficient Algorithms for Global Optimization Methods in Computer Vision, held in Dagstuhl Castle, Germany, in November 2011.
Автор: Rae Earnshaw; J.E. Bresenham; R.A. Earnshaw; M.L.V Название: Fundamental Algorithms for Computer Graphics ISBN: 354054397X ISBN-13(EAN): 9783540543978 Издательство: Springer Рейтинг: Цена: 10610.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proceedings of the NATO Advanced Study Institute on "Fundamental Algorithms for Computer Graphics" held at Ilkley, Yorkshire, England, March 30 - April 12, 1985
Автор: Keith O. Geddes; Stephen R. Czapor; George Labahn Название: Algorithms for Computer Algebra ISBN: 147578323X ISBN-13(EAN): 9781475783230 Издательство: Springer Рейтинг: Цена: 18294.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions.
Автор: Reingold, Edward M. (illinois Institute Of Technology) Dershowitz, Nachum (tel-aviv University) Название: Calendrical calculations ISBN: 1107683165 ISBN-13(EAN): 9781107683167 Издательство: Cambridge Academ Рейтинг: Цена: 6336.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This unique resource now includes coverage of Unix dates, Italian time, the Akan, Icelandic, Saudi Arabian Umm al-Qura, Babylonian, Samaritan, and Nepalese calendars, plus expanded treatments of Islamic and Hebrew calendars. The astronomical functions have been rewritten for more accurate results and include calculations of moonrise and moonset.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
