Tags
Language
Tags
May 2024
Su Mo Tu We Th Fr Sa
28 29 30 1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31 1

New Computational Paradigms: Changing Conceptions of What is Computable

Posted By: AvaxGenius
New Computational Paradigms: Changing Conceptions of What is Computable

New Computational Paradigms: Changing Conceptions of What is Computable by S. Barry Cooper
English | PDF | 2008 | 555 Pages | ISBN : 0387360336 | 5.2 MB

In recent years, classical computability has expanded beyond its original scope to address issues related to computability and complexity in algebra, analysis, and physics. The deep interconnection between "computation" and "proof" has originated much of the most significant work in constructive mathematics and mathematical logic of the last 70 years. Moreover, the increasingly compelling necessity to deal with computability in the real world (such as computing on continuous data, biological computing, and physical models) has brought focus to new paradigms of computation that are based on biological and physical models. These models address questions of efficiency in a radically new way and even threaten to move the so-called Turing barrier, i.e. the line between the decidable and the un-decidable.

Scheduling for Parallel Processing

Posted By: AvaxGenius
Scheduling for Parallel Processing

Scheduling for Parallel Processing by Maciej Drozdowski
English | PDF | 2009 | 395 Pages | ISBN : 1848823096 | 7.2 MB

To take full advantage of high performance computing, parallel applications must be carefully managed to guarantee quality of service and fairness in using shared resources. Scheduling for parallel computing is an interdisciplinary subject joining many fields, and the broadness of research yields an immense number and diversity of models for understanding scheduling problems.

Finite Model Theory and Its Applications

Posted By: AvaxGenius
Finite Model Theory and Its Applications

Finite Model Theory and Its Applications by Erich Grädel
English | PDF | 2007 | 447 Pages | ISBN : 3540004289 | 7.9 MB

This book gives a broad overview of core topics of finite model theory: expressive power, descriptive complexity, and zero-one laws, together with selected applications to database theory and artificial intelligence, especially, constraint databases and constraint satisfaction problems.

Introduction to Circuit Complexity: A Uniform Approach

Posted By: AvaxGenius
Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach by Heribert Vollmer
English | PDF | 1999 | 277 Pages | ISBN : 3642083986 | 23.5 MB

This advanced textbook presents a broad and up-to-date view of the computational complexity theory of Boolean circuits. It combines the algorithmic and the computability-based approach, and includes extensive discussion of the literature to facilitate further study.

Quantum Computing

Posted By: AvaxGenius
Quantum Computing

Quantum Computing by Mika Hirvensalo
English | PDF | 2001 | 199 Pages | ISBN : 3662044633 | 15.3 MB

The twentieth century witnessed the birth of revolutionary ideas in the phys­ ical sciences. These ideas began to shake the traditional view of the universe dating back to the days of Newton, even to the days of Galileo. Albert Ein­ stein is usually identified as the creator of the relativity theory, a theory that is used to model the behavior of the huge macrosystems of astronomy.

Advances in Algorithms, Languages, and Complexity

Posted By: AvaxGenius
Advances in Algorithms, Languages, and Complexity

Advances in Algorithms, Languages, and Complexity by Ding-Zhu Du
English | PDF | 1997 | 419 Pages | ISBN : 0792343964 | 41.43 MB

This book contains a collection of survey papers in the areas of algorithms, lan­ guages and complexity, the three areas in which Professor Ronald V. Book has made significant contributions. As a fonner student and a co-author who have been influenced by him directly, we would like to dedicate this book to Professor Ronald V. Book to honor and celebrate his sixtieth birthday. Professor Book initiated his brilliant academic career in 1958, graduating from Grinnell College with a Bachelor of Arts degree.

Graphs, Networks and Algorithms

Posted By: AvaxGenius
Graphs, Networks and Algorithms

Graphs, Networks and Algorithms by Dieter Jungnickel
English | PDF | 597 | 1999 | ISBN : 3662038242 | 50.27 MB

From the reviews of the German edition:
"Combinatorial optimization, along with graph algorithms and complexity theory is booming. This book treats the most prominent problems which are polynomially solvable. The Traveling Salesman Problem is discussed as a paradigm of an NP-complete problem. The text is well written, most exercises are quite enlightening and the hints are clear. Algorithms are described very thoroughly. The list of references is impressive and gives good guidance for further reading.

Complexity in Landscape Ecology

Posted By: AvaxGenius
Complexity in Landscape Ecology

Complexity in Landscape Ecology by David G. Green
English | PDF,EPUB | 2020 | 262 Pages | ISBN : 3030467724 | 36 MB

This book examines key concepts and analytical approaches in complexity theory as it applies to landscape ecology, including complex networks, connectivity, criticality, feedback, and self-organisation. It then reviews the ways that these ideas have led to new insights into the nature of ecosystems and the role of processes in landscapes.

The Pillars of Computation Theory: State, Encoding, Nondeterminism (Repost)

Posted By: AvaxGenius
The Pillars of Computation Theory: State, Encoding, Nondeterminism (Repost)

The Pillars of Computation Theory: State, Encoding, Nondeterminism by Arnold L. Rosenberg
English | PDF | 2010 | 331 Pages | ISBN : 0387096388 | 3.13 MB

Computation theory is a discipline that strives to use mathematical tools and concepts in order to expose the nature of the activity that we call “computation” and to explain a broad range of observed computational phenomena. Why is it harder to perform some computations than others? Are the differences in difficulty that we observe inherent, or are they artifacts of the way we try to perform the computations? Even more basically: how does one reason about such questions?

Algorithmic Randomness and Complexity

Posted By: AvaxGenius
Algorithmic Randomness and Complexity

Algorithmic Randomness and Complexity by Rodney G. Downey
English | PDF | 2010 | 883 Pages | ISBN : 0387955674 | 8.55 MB

Intuitively, a sequence such as 101010101010101010… does not seem random, whereas 101101011101010100…, obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely? What does it mean to say that an individual mathematical object such as a real number is random, or to say that one real is more random than another? And what is the relationship between randomness and computational power. The theory of algorithmic randomness uses tools from computability theory and algorithmic information theory to address questions such as these.

Complexity Theory and Cryptology: An Introduction to Cryptocomplexity (Repost)

Posted By: AvaxGenius
Complexity Theory and Cryptology: An Introduction to Cryptocomplexity (Repost)

Complexity Theory and Cryptology: An Introduction to Cryptocomplexity by Jörg Rothe
English | PDF | 2005 | 488 Pages | ISBN : 3540221476 | 4.21 MB

Modern cryptology employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research in complexity theory often is motivated by questions and problems arising in cryptology. This book takes account of this trend, and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas.