Computability and Complexity Theory, Steven Homer; Alan L. Selman

Автор: Jens Blanck; Vasco Brattka; Peter Hertling
Название: Computability and Complexity in Analysis
ISBN: 3540421971 ISBN-13(EAN): 9783540421979
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Computability and Complexity in Analysis, CCA 2000, held in Swansea, UK, in September 2000. The book presents a cross-section on contemporary research on computability and complexity in analysis.

Автор: Kozen, Dexter
Название: Automata and computability
ISBN: 1461273099 ISBN-13(EAN): 9781461273097
Издательство: Springer
Рейтинг:
Цена: 9083.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This textbook provides undergraduate students with an introduction to the basic theoretical models of computability. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course. Plenty of exercises are provided, ranging from the easy to the challenging.

Автор: Klaus Weihrauch
Название: Computability
ISBN: 3642699677 ISBN-13(EAN): 9783642699672
Издательство: Springer
Рейтинг:
Цена: 11173.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Lane A. Hemaspaandra; Alan L. Selman
Название: Complexity Theory Retrospective II
ISBN: 1461273196 ISBN-13(EAN): 9781461273196
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume provides a survey of the subject in the form of a collection of articles written by experts, that together provides a comprehensive guide to research.

Автор: R. Pruim; Ingo Wegener
Название: Complexity Theory
ISBN: 3642059147 ISBN-13(EAN): 9783642059148
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models

Автор: Peter B?rgisser; T. Lickteig; Michael Clausen; Moh
Название: Algebraic Complexity Theory
ISBN: 3642082289 ISBN-13(EAN): 9783642082283
Издательство: Springer
Рейтинг:
Цена: 13969.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert`s tenth problem.

Автор: Adam Day; Michael Fellows; Noam Greenberg; Bakhady
Название: Computability and Complexity
ISBN: 3319500619 ISBN-13(EAN): 9783319500614
Издательство: Springer
Рейтинг:
Цена: 13974.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The volume contains 42 papers presenting original unpublished research, or expository and survey results in Turing degrees, computably enumerable sets, computable algebra, computable model theory, algorithmic randomness, reverse mathematics, and parameterized complexity, all areas in which Rod Downey has had significant interests and influence.

Автор: Mark Braverman; Michael Yampolsky
Название: Computability of Julia Sets
ISBN: 3642088066 ISBN-13(EAN): 9783642088063
Издательство: Springer
Рейтинг:
Цена: 13275.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Among all computer-generated mathematical images, Julia sets of rational maps occupy one of the most prominent positions. This accessible book summarizes the present knowledge about the computational properties of Julia sets in a self-contained way.

Автор: Alan L. Selman
Название: Complexity Theory Retrospective
ISBN: 1461287936 ISBN-13(EAN): 9781461287933
Издательство: Springer
Рейтинг:
Цена: 19564.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work.

Автор: Lane A. Hemaspaandra; Mitsunori Ogihara
Название: The Complexity Theory Companion
ISBN: 3642086845 ISBN-13(EAN): 9783642086847
Издательство: Springer
Рейтинг:
Цена: 10475.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Invitation Invitation Secret Secret 1 1 Algorithms Algorithms are are at at the the heart heart of of complexity complexity theory. theory. That That is is the the dark dark secret secret of of complexity complexity theory. theory. It It is is recognized recognized by by complex- complex- ity ity theorists, theorists, but but would would be be literally literally incredible incredible to to most most others. others. In In this this book, book, we we hope hope to to make make this this secret secret credible. credible. In In fact, fact, the the real real secret secret is is even even more more dramatic. dramatic. Secret Secret 2 2 Simple Simple algorithms algorithms are are at at the the heart heart of of complexity complexity theory. theory. A A corollary corollary of of Secret Secret 2 2 is is that that every every practitioner practitioner of of computer computer science science or or stu- stu- dent dent of of computer computer science science already already possesses possesses the the ability ability required required to to understand, understand, enjoy, enjoy, and and employ employ complexity complexity theory. theory.

Автор: Yaser S. Abu-Mostafa
Название: Complexity in Information Theory
ISBN: 1461283442 ISBN-13(EAN): 9781461283447
Издательство: Springer
Рейтинг:
Цена: 14673.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The means and ends of information theory and computational complexity have grown significantly closer over the past decade. The basic assumption of limited computing resources is the premise for cryptography, where the distinction is made between available information and accessible information.