The Leading eBooks Store Online

for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...

New to eBooks.com?

Learn more
Browse our categories
  • Bestsellers - This Week
  • Foreign Language Study
  • Pets
  • Bestsellers - Last 6 months
  • Games
  • Philosophy
  • Archaeology
  • Gardening
  • Photography
  • Architecture
  • Graphic Books
  • Poetry
  • Art
  • Health & Fitness
  • Political Science
  • Biography & Autobiography
  • History
  • Psychology & Psychiatry
  • Body Mind & Spirit
  • House & Home
  • Reference
  • Business & Economics
  • Humor
  • Religion
  • Children's & Young Adult Fiction
  • Juvenile Nonfiction
  • Romance
  • Computers
  • Language Arts & Disciplines
  • Science
  • Crafts & Hobbies
  • Law
  • Science Fiction
  • Current Events
  • Literary Collections
  • Self-Help
  • Drama
  • Literary Criticism
  • Sex
  • Education
  • Literary Fiction
  • Social Science
  • The Environment
  • Mathematics
  • Sports & Recreation
  • Family & Relationships
  • Media
  • Study Aids
  • Fantasy
  • Medical
  • Technology
  • Fiction
  • Music
  • Transportation
  • Folklore & Mythology
  • Nature
  • Travel
  • Food and Wine
  • Performing Arts
  • True Crime
  • Foreign Language Books
Computational complexity

Most popular at the top

  • Computational Complexityby Marius Zimand

    Elsevier Science 2004; US$ 225.00

    There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain... more...

  • Complex Systemsby Jean-Philippe Bouchaud; Marc Mézard; Jean Dalibard

    Elsevier Science 2011; US$ 87.95

    There has been recently some interdisciplinary convergence on a number of precise topics which can be considered as prototypes of complex systems. This convergence is best appreciated at the level of the techniques needed to deal with these systems, which include: 1) A domain of research around a multiple point where statistical physics, information... more...

  • Kolmogorov's Heritage in Mathematicsby Eric Charpentier; Nikolai Nikolski

    Springer 2007; US$ 69.95

    A.N. Kolmogorov (b. Tambov 1903, d. Moscow 1987) was one of the most brilliant mathematicians that the world has ever known. Incredibly deep and creative, he was able to approach each subject with a completely new point of view: in a few magnificent pages, which are models of shrewdness and imagination, and which astounded his contemporaries, he changed... more...

  • Computational Complexityby Oded Goldreich

    Cambridge University Press 2008; US$ 68.00

    A conceptual introduction to modern topics in complexity for advanced undergraduate and graduate students. more...

  • Computational Complexityby Sanjeev Arora; Boaz Barak

    Cambridge University Press 2009; US$ 44.00

    New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students. more...

  • From System Complexity to Emergent Propertiesby M.A. Aziz-Alaoui; Cyrille Bertelle

    Springer 2009; US$ 169.00

    Emergence and complexity refer to the appearance of higher-level properties and behaviours of a system that obviously comes from the collective dynamics of that system's components. This book highlights complexity modelling through dynamical or behavioral systems. more...

  • Perspectives in Computationby Robert Geroch

    University of Chicago Press 2009; US$ 25.00

    Computation is the process of applying a procedure or algorithm to the solution of a mathematical problem. Mathematicians and physicists have been occupied for many decades pondering which problems can be solved by which procedures, and, for those that can be solved, how this can most efficiently be done. In recent years, quantum mechanics has augmented... more...

  • The P=NP Question and Gödel's Lost Letterby Richard J. Lipton

    Springer 2010; US$ 119.00

    The P=NP question is one of the great problems of science, which has intrigued computer scientists and mathematicians for decades. Despite the abundant research in theoretical computer science regarding the P=NP question, it has not been solved. "The P=NP Question and Godel's Lost Letter" covers historical developments (including the... more...

  • Coping with Complexityby Alexander N. Gorban; Dirk Roose

    Springer 2010; US$ 209.00

    This volume contains the extended version of selected talks given at the international research workshop 'Coping with Complexity: Model Reduction and Data Analysis', Ambleside, UK, August 31 - September 4, 2009. This book is deliberately broad in scope and aims at promoting new ideas and methodological perspectives. The topics of the chapters... more...

  • Computability and Randomnessby André Nies

    Oxford University Press 2009; US$ 44.99

    The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshops, and publications on the subject. The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity... more...