Textbooks

Set Descending Direction

per page

  1. Oxford University Press An Introduction to Quantum Computing

     
    $452.00
     

    quick look

    • ISBN: 9780198570004
    • Authors: Phillip Kaye,Raymond Laflamme,Michele Mosca
    • Publisher: Oxford University Press UK
    • Publication Date: 24/11/2006
    This concise, accessible introduction to quantum computing is aimed at advanced undergraduate and beginning graduate students from a variety of scientific backgrounds. The text is technically detailed and clearly illustrated throughout with diagrams and exercises.

     

    Availability: Out of stock

  2. Oxford University Press An Introduction to Quantum Computing

     
    $139.95
     

    quick look

    • ISBN: 9780198570493
    • Authors: Phillip Kaye,Raymond Laflamme,Michele Mosca
    • Publisher: Oxford University Press UK
    • Publication Date: 01/11/2006
    This concise, accessible introduction to quantum computing is aimed at advanced undergraduate and beginning graduate students from a variety of scientific backgrounds. The text is technically detailed and clearly illustrated throughout with diagrams and exercises.

     

    Availability: Out of stock

  3. Cambridge University Press Computational Complexity

     
    $106.95
     

    quick look

    • ISBN: 9780521424264
    • Authors: Sanjeev Arora,Boaz Barak
    • Edition: 1
    • Publisher: Cambridge University Press
    • Publication Date: 16/06/2009
    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.

     

    Availability: Out of stock

Set Descending Direction

per page