The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...
New to eBooks.com?Learn more
- Bestsellers - This Week
- Foreign Language Study
- Bestsellers - Last 6 months
- Graphic Books
- Health & Fitness
- Political Science
- Biography & Autobiography
- Psychology & Psychiatry
- Body Mind & Spirit
- House & Home
- Business & Economics
- Children's & Young Adult Fiction
- Juvenile Nonfiction
- Language Arts & Disciplines
- Crafts & Hobbies
- Science Fiction
- Current Events
- Literary Collections
- Literary Criticism
- Literary Fiction
- Social Science
- The Environment
- Sports & Recreation
- Family & Relationships
- Study Aids
- Folklore & Mythology
- Food and Wine
- Performing Arts
- True Crime
- Foreign Language Books
Most popular at the top
- Oxford University Press 2006; US$ 139.99
This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems.The book is divided into three parts: a broad introduction that provides the general philosophy and motivation;... more...
- World Scientific Publishing Company 1990; US$ 67.00
This proceedings contains contributions on topics such as the models of computation, analysis and design of sequential and parallel algorithms, data structures and their applications, approximating algorithms and probabilistic analysis, and computational complexity. Contents: Analysis and Implementation of Parallel Uniform Hashing (F Luccio et al);... more...
- Springer Berlin Heidelberg 2008; US$ 119.00
This is the first treatment in book format of proof-theoretic transformations - known as proof interpretations - that focuses on applications to ordinary mathematics. It covers both the necessary logical machinery behind the proof interpretations that are used in recent applications as well as - via extended case studies - carrying out some of these... more...
- Elsevier Science 2011; US$ 9.99
Computability Theory: An Introduction to Recursion Theory, provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized... more...
- Elsevier Science 2000; US$ 175.00
This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There... more...
- Elsevier Science 2014; US$ 72.95
Studies in Logic and the Foundations of Mathematics, Volume 123: Constructivism in Mathematics: An Introduction, Vol. II focuses on various studies in mathematics and logic, including metric spaces, polynomial rings, and Heyting algebras. The publication first takes a look at the topology of metric spaces, algebra, and finite-type arithmetic and theories... more...
- Morgan & Claypool Publishers 2011; US$ 45.00
Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single... more...