9780199233212 - The Nature of Computation de Moore, Cristopher; Mertens, Stephan (23 resultados)

Paperback. Condición: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Condición: NEW.

Hardcover. Condición: Used Good. No Jacket. As new large hardback with glossy cover. No marks or writing noted, still tight but heavy in its binding.

HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: New. In.

Condición: New.

Hardcover. Condición: Brand New. 1st edition. 985 pages. 9.69x7.44x0.12 inches. In Stock.

Condición: New. 2011. 1st Edition. Hardcover. Why are some problems easy to solve, while others seem nearly impossible? What can we compute with a given amount of time or memory, and what cannot be computed at all? How will quantum physics change the landscape of computation? This book gives a playful and accessible introduction to the deep ideas of theoretical computer science. Num Pages: 1004 pages, 338 b/w line illustrations, and 30 b/w halftones. BIC Classification: PBCD; PH; UGK. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 249 x 195 x 55. Weight in Grams: 2316. . . . . .

Condición: New.

Condición: New. pp. xvii + 985 338 Illus.

Condición: As New. Unread book in perfect condition.

hardcover. Condición: Very Good. Very Good. Used with some reading wear but is still in great reading condition. May have limited markings although none were noted.

Condición: As New. Unread book in perfect condition.

Buch. Condición: Neu. Neuware - Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoreticalcomputer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. The authors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is sofundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduate and undergraduate students, scientists from other areas who have longwanted to understand this subject, and experts who want to fall in love with this field all over again.

Condición: New. Why are some problems easy to solve, while others seem nearly impossible? What can we compute with a given amount of time or memory, and what cannot be computed at all? How will quantum physics change the landscape of computation? This book gives a playful.

Condición: New. 2011. 1st Edition. Hardcover. Why are some problems easy to solve, while others seem nearly impossible? What can we compute with a given amount of time or memory, and what cannot be computed at all? How will quantum physics change the landscape of computation? This book gives a playful and accessible introduction to the deep ideas of theoretical computer science. Num Pages: 1004 pages, 338 b/w line illustrations, and 30 b/w halftones. BIC Classification: PBCD; PH; UGK. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 249 x 195 x 55. Weight in Grams: 2316. . . . . . Books ship from the US and Ireland.

Hardcover. Condición: new. Hardcover. Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoreticalcomputer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. Theauthors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. Thebook is intended for graduate and undergraduate students, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all overagain. Why are some problems easy to solve, while others seem nearly impossible? What can we compute with a given amount of time or memory, and what cannot be computed at all? How will quantum physics change the landscape of computation? This book gives a playful and accessible introduction to the deep ideas of theoretical computer science. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Condición: New. pp. xvii + 985.

Condición: New. pp. xvii + 985 Epilogue.

Hardcover. Condición: Brand New. 1st edition. 985 pages. 9.69x7.44x0.12 inches. In Stock.

Hardcover. Condición: new. Hardcover. Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoreticalcomputer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. Theauthors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. Thebook is intended for graduate and undergraduate students, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all overagain. Why are some problems easy to solve, while others seem nearly impossible? What can we compute with a given amount of time or memory, and what cannot be computed at all? How will quantum physics change the landscape of computation? This book gives a playful and accessible introduction to the deep ideas of theoretical computer science. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condición: Usado - bueno.

Hardcover. Condición: new. Hardcover. Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoreticalcomputer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. Theauthors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. Thebook is intended for graduate and undergraduate students, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all overagain. Why are some problems easy to solve, while others seem nearly impossible? What can we compute with a given amount of time or memory, and what cannot be computed at all? How will quantum physics change the landscape of computation? This book gives a playful and accessible introduction to the deep ideas of theoretical computer science. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.