Welcome to our book review site go-pdf.online!

You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.

Sign up

Computational Complexity
  • Language: en
  • Pages: 523

Computational Complexity

The first unified introduction and reference for the field of computational complexity. Virtually non-existent only 25 years ago, computational complexity has expanded tremendously and now comprises a major part of the researh activity in theoretical science.

Combinatorial Optimization
  • Language: en
  • Pages: 530

Combinatorial Optimization

This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.

Turing (A Novel about Computation)
  • Language: en
  • Pages: 274

Turing (A Novel about Computation)

  • Type: Book
  • -
  • Published: 2005-02-11
  • -
  • Publisher: MIT Press

The world of computation according to Turing, an interactive tutoring program, as told to star-crossed lovers: a novel. Our hero is Turing, an interactive tutoring program and namesake (or virtual emanation?) of Alan Turing, World War II code breaker and father of computer science. In this unusual novel, Turing's idiosyncratic version of intellectual history from a computational point of view unfolds in tandem with the story of a love affair involving Ethel, a successful computer executive, Alexandros, a melancholy archaeologist, and Ian, a charismatic hacker. After Ethel (who shares her first name with Alan Turing's mother) abandons Alexandros following a sundrenched idyll on Corfu, Turing ...

Algorithms
  • Language: en
  • Pages: 338

Algorithms

This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include:The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course but can be covered in an advanced algorithms cou...

The Theory of Database Concurrency Control
  • Language: en
  • Pages: 264
Computational Complexity
  • Language: en
  • Pages: 609

Computational Complexity

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

Kurt Gödel and the Foundations of Mathematics
  • Language: en
  • Pages: 541

Kurt Gödel and the Foundations of Mathematics

This volume commemorates the life, work and foundational views of Kurt Gödel (1906–78), most famous for his hallmark works on the completeness of first-order logic, the incompleteness of number theory, and the consistency - with the other widely accepted axioms of set theory - of the axiom of choice and of the generalized continuum hypothesis. It explores current research, advances and ideas for future directions not only in the foundations of mathematics and logic, but also in the fields of computer science, artificial intelligence, physics, cosmology, philosophy, theology and the history of science. The discussion is supplemented by personal reflections from several scholars who knew Gödel personally, providing some interesting insights into his life. By putting his ideas and life's work into the context of current thinking and perceptions, this book will extend the impact of Gödel's fundamental work in mathematics, logic, philosophy and other disciplines for future generations of researchers.

Twenty Lectures on Algorithmic Game Theory
  • Language: en
  • Pages: 357

Twenty Lectures on Algorithmic Game Theory

Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.

The Nature of Computation
  • Language: en
  • Pages: 1498

The Nature of Computation

  • Type: Book
  • -
  • Published: 2011-08-11
  • -
  • Publisher: OUP Oxford

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 theoretical computer 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 a...

Logicomix
  • Language: en
  • Pages: 347

Logicomix

This brilliantly illustrated tale of reason, insanity, love and truth recounts the story of Bertrand Russell's life. Raised by his paternal grandparents, young Russell was never told the whereabouts of his parents. Driven by a desire for knowledge of his own history, he attempted to force the world to yield to his yearnings- for truth, clarity and resolve. As he grew older, and increasingly sophisticated as a philosopher and mathematician, Russell strove to create an objective language with which to describe the world - one free of the biases and slippages of the written word. At the same time, he began courting his first wife, teasing her with riddles and leaning on her during the darker da...