Поиск книг                    Поиск по списку ISBN Расширенный поиск    
  Зарубежные издательства Российские издательства  
   Авторы    Каталог книг    Издательства    Новинки    Учебная литература    Специальные предложения  Бестселлеры
Книги зарубежных издательств на иностранных языках
Книги российских издательств
Представительство в Казахстане
Вход в систему   
Регистрация  Забыли?
Ваши заказы
Доставка и Оплата
Заказ по телефону/email
Есть вопрос?
О компании
Online Каталоги   
Cambridge University Press
Каталог учебной литературы
по английскому языку >>>

Oxford University Press
Каталог учебной литературы
по английскому языку >>>

Каталог учебной литературы
по английскому языку >>>

Pearson ELT

Читайте отзывы покупателей и оценивайте качество магазина на Яндекс.Маркете

Computational complexity, Arora, Sanjeev Barak, Boaz

Computational complexity

Автор: Arora, Sanjeev Barak, Boaz
Название:  Computational complexity   (Вычислительная сложность)
Издательство: Cambridge Academ
Теория кодирования и криптология
Математическая теория вычисления

ISBN: 0521424267
ISBN-13(EAN): 9780521424264
ISBN: 0-521-42426-7
ISBN-13(EAN): 978-0-521-42426-4
Обложка/Формат: Hardcover
Страницы: 594
Вес: 1.215 кг.
Дата издания: 01.06.2009
Язык: ENG
Иллюстрации: 72 line figures 1 tone 6 tables 307 exercise
Размер: 25.40 x 18.03 x 3.56 cm
Читательская аудитория: Professional & vocational
Ссылка на Издательство: Link
Поставляется из: Англии
Описание: This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.
Описание: New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Дополнительное описание:

 Варианты приобретения 
  Кол-во Наличие на складе Цена р. Купить / Отложить
1 Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Англия: 2шт.  Склад Америка: 62шт.  
При оформлении заказа до: 19 май 2017
Ориентировочная дата поставки: 12 июн 2017
Добавить в корзину
Add to Wish list

Отзывы покупателей.
Добавить отзыв.
Computational complexity

Автор: Oded Goldreich
Название: Computational complexity
ISBN: 052188473X ISBN-13(EAN): 9780521884730
Издательство: Cambridge Academ
Цена: 4996 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers.

A Course in Computational Algebraic Number Theory

Автор: Cohen
Название: A Course in Computational Algebraic Number Theory
ISBN: 3540556400 ISBN-13(EAN): 9783540556404
Издательство: Springer
Цена: 5001 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: This book describes 148 algorithms which are fundamental for number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters lead the reader to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations. The last three chapters give a survey of factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The book ends with a description of available computer packages and some useful tables. The book also contains a large number of exercises. Written by an authority in the field, and one with great practical and teaching experience it is sure to become the standard and indispensable reference on the subject.

Python Scripting for Computational Science

Автор: Langtangen
Название: Python Scripting for Computational Science
ISBN: 3540294155 ISBN-13(EAN): 9783540294153
Издательство: Springer
Цена: 3846 р.
Наличие на складе: Нет в наличии.
Описание: The goal of this book is to teach computational scientists how to develop tailored, flexible, and human-efficient working environments built from small programs (scripts) written in the easy-to-learn, high-level language Python. The focus is on examples and applications of relevance to computational scientists: gluing existing applications and tools, e.g. for automating simulation, data analysis, and visualization; steering simulations and computational experiments; equipping old programs with graphical user interfaces; making computational Web applications; and creating interactive interfaces with a Maple/Matlab-like syntax to numerical applications in C/C++ or Fortran.

In short, scripting with Python makes you much more productive, increases the reliability of your scientific work and lets you have more fun - on Unix, Windows and Macintosh. All the tools and examples in this book are open source codes. The second edition features new material, reorganization of text, improved examples and tools, updated information, and correction of errors.


Computational Geometry

Автор: de Berg
Название: Computational Geometry
ISBN: 3540656200 ISBN-13(EAN): 9783540656203
Издательство: Springer
Цена: 2537 р.
Наличие на складе: Нет в наличии.

Computational Electromagnetics

Автор: Bondeson, Anders
Название: Computational Electromagnetics
ISBN: 0387261583 ISBN-13(EAN): 9780387261584
Издательство: Springer
Цена: 4231 р.
Наличие на складе: Невозможна поставка.
Описание: Computational electromagnetics is a young and growing discipline, expanding as a result of the steadily increasing demand for software for the design and analysis of electrical devices. This book introduces three of the most popular numerical methods for simulating electromagnetic fields: the finite difference method, the finite element method and the method of moments. In particular it focuses on how these methods are used to obtain valid approximations to the solutions of Maxwell's equations, using, for example, "staggered grids" and "edge elements." The main goal of the book is to make the reader aware of different sources of errors in numerical computations, and also to provide the tools for assessing the accuracy of numerical methods and their solutions. To reach this goal, convergence analysis, extrapolation, von Neumann stability analysis, and dispersion analysis are introduced and used frequently throughout the book. Another major goal of the book is to provide students with enough practical understanding of the methods so they are able to write simple programs on their own. To achieve this, the book contains several MATLAB programs and detailed description of practical issues such as assembly of finite element matrices and handling of unstructured meshes. Finally, the book aims at making the students well-aware of the strengths and weaknesses of the different methods, so they can decide which method is best for each problem. The intended audience of this text consists of undergraduate and beginning graduate students with basic knowledge of electromagnetic field theory, numerical analysis, and MATLAB-programming.

Functional Analysis in Computational Mathematics / An Introduction

Автор: Lebedev V.I.
Название: Functional Analysis in Computational Mathematics / An Introduction
ISBN: 0817638881 ISBN-13(EAN): 9780817638887
Издательство: Birkhauser Verlag AG
Цена: 7477 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.

Computational Methods for Linear Integral Equations

Автор: Kythe Prem, Puri Pratap
Название: Computational Methods for Linear Integral Equations
ISBN: 0817641920 ISBN-13(EAN): 9780817641924
Издательство: Birkhauser Verlag AG
Цена: 11020 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: Integral equations have wide applications in various fields, including continuum mechanics, potential theory, geophysics, electricity and magnetism, kinetic theory of gases, hereditary phenomena in physics and biology, renewal theory, quantum mechanics, radiation, optimization, optimal control systems, communication theory, mathematical economics, population genetics, queueing theory, and medicine. Computational Methods for Linear Integral Equations presents basic theoretical material that deals with numerical analysis, convergence, error estimates, and accuracy. The unique computational aspect leads the reader from theoretical and practical problems all the way through to computation with hands-on guidance for input files and the execution of computer programs.Features:* Offers all supporting MathematicaВ® files related to the book via the Internet at the authors' Web sites: www.math.uno.edu/fac/pkythe.html or www.math.uno.edu/fac/ppuri.html* Contains identification codes for problems, related methods, and computer programs that are cross-referenced throughout the book to make the connections easy to understand* Illustrates a how-to approach to computational work in the development of algorithms, construction of input files, timing, and accuracy analysis* Covers linear integral equations of Fredholm and Volterra types of the first and second kinds as well as associated singular integral equations, integro-differential equations, and eigenvalue problems* Provides clear, step-by-step guidelines for solving difficult and complex computational problemsThis book is an essential reference and authoritative resource for all professionals, graduate students, and researchers in mathematics, physical sciences, and engineering. Researchers interested in the numerical solution of integral equations will find its practical problem-solving style both accessible and useful for their work.

Computational Combinatorial Optimization / Optimal or Provably Near-Optimal Solutions

Автор: JГјnger Michael, Naddef Denis
Название: Computational Combinatorial Optimization / Optimal or Provably Near-Optimal Solutions
ISBN: 3540428771 ISBN-13(EAN): 9783540428770
Издательство: Springer
Цена: 4462 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.

Elements of Computational Statistics

Автор: Gentle James E.
Название: Elements of Computational Statistics
ISBN: 0387954899 ISBN-13(EAN): 9780387954899
Издательство: Springer
Цена: 5925 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: Computationally intensive methods have become widely used both for statistical inference and for exploratory analyses of data. The methods of computational statistics involve resampling, partitioning, and multiple transformations of a dataset. They may also make use of randomly generated artificial data. Implementation of these methods often requires advanced techniques in numerical analysis, so there is a close connection between computational statistics and statistical computing. This book describes techniques used in computational statistics, and addresses some areas of application of computationally intensive methods, such as density estimation, identification of structure in data, and model building. Although methods of statistical computing are not emphasized in this book, numerical techniques for transformations, for function approximation, and for optimization are explained in the context of the statistical methods. The book includes exercises, some with solutions. The book can be used as a text or supplementary text for various courses in modern statistics at the advanced undergraduate or graduate level, and it can also be used as a reference for statisticians who use computationally-intensive methods of analysis. Although some familiarity with probability and statistics is assumed, the book reviews basic methods of inference, and so is largely self-contained. James Gentle is University Professor of Computational Statistics at George Mason University. He is a Fellow of the American Statistical Association and a member of the International Statistical Institute. He has held several national offices in the American Statistical Association and has served as associate editor for journals of the ASA as well as for other journals in statistics and computing. He is the author of Random Number Generation and Monte Carlo Methods and Numerical Linear Algebra for Statistical Applications.

Computational Invariant Theory

Автор: Derksen Harm, Kemper Gregor
Название: Computational Invariant Theory
ISBN: 3540434763 ISBN-13(EAN): 9783540434764
Издательство: Springer
Цена: 7465 р.
Наличие на складе: Нет в наличии.
Описание: Throughout the history of invariant theory, computational methods have always been at the center of attention. This book, the first volume of the new subseries on "Invariant Theory and Algebraic Transformation Groups", provides a comprehensive and up-to-date overview of the algorithmic aspects of invariant theory. Special features are an introductory chapter on GrГ¶bner basis methods and a chapter on applications, covering fields as disparate as graph theory, coding theory, dynamical systems, and computer vision. Both authors have made significant contributions to the theory and practice of algorithmic invariant theory. Numerous illustrative examples and a careful selection of proofs make the book accessible to non-specialists.The book will be very useful to postgraduate students as well as researchers in geometry, computer algebra, and, of course, invariant theory.

Computational Statistical Physics / From Billards to Monte-Carlo

Автор: Hoffmann K.-H., Schreiber Michael
Название: Computational Statistical Physics / From Billards to Monte-Carlo
ISBN: 3540421602 ISBN-13(EAN): 9783540421603
Издательство: Springer
Цена: 8466 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: In this book, 16 experts describe the application of methods of statistical physics to various areas in physics: disordered materials, quasicrystals, semiconductors, and also to other areas beyond physics, such as financial markets, game theory, evolution, and traffic planning, in which statistical physics has recently become significant.

Constraints in Computational Logics. Theory and Applications / International Summer School, CCL`99 Gif-sur-Yvette, France, September 5-8, 1999 Revised Lectures

Автор: Comon Hubert, Marche Claude, Treinen Ralf
Название: Constraints in Computational Logics. Theory and Applications / International Summer School, CCL`99 Gif-sur-Yvette, France, September 5-8, 1999 Revised Lectures
ISBN: 3540419500 ISBN-13(EAN): 9783540419501
Издательство: Springer
Цена: 4077 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: Constraints provide a declarative way of representing infinite sets of data. They are well suited for combining different logical or programming paradigms as has been known for constraint logic programming since the 1980s and more recently for functional programming. The use of constraints in automated deduction is more recent and has proved to be very successful, moving the control from the meta-level to the constraints, which are now first-class objects.This monograph-like book presents six thoroughly reviewed and revised lectures given by leading researchers at the summer school organized by the ESPRIT CCL Working Group in Gif-sur-Yvette, France, in September 1999. The book offers coherently written chapters on constraints and constraint solving, constraint solving on terms, combining constraint solving, constraints and theorem proving, functional and constraint logic programming, and building industrial applications.

ООО "Логосфера " Тел:(495) 748-51-16 Факс: (495) 689-73-83 доб.116 www.logobook.ru
Visa, Master Card, Diners, AMEX, JCB, Web Money, Yandex Money Сбербанк онлайн