Explore the latest books of this year!
Bookbot

Uwe Schöning

    December 28, 1955
    Theoretische Informatik kurzgefasst
    Algorithmik
    Ideen der Informatik
    Logic for Computer Scientists
    Gems of theoretical computer science
    The Satisfiability Problem. Das Erfüllbarkeitsproblem SAT, englische Ausgabe
    • 2008

      Logic for Computer Scientists

      • 180 pages
      • 7 hours of reading
      3.3(16)Add rating

      Focusing on the intersection of Logic and Computer Science, this book highlights the significance of Logic in modern applications like Automated Theorem Proving and Logic Programming. Originating from lectures at EWH University in the late 1980s, it aims to provide undergraduates with a solid theoretical foundation in these concepts, requiring only basic mathematical knowledge and familiarity with a programming language like PASCAL. The text acknowledges contributions from various individuals in both the original German and English translations.

      Logic for Computer Scientists
    • 1998

      This book assembles some of the most important problems and solutions in theoretical computer science-from computability, logic, circuit theory, and complexity. The book presents these important results with complete proofs in an understandable form. It also presents previously open problems that have found (perhaps unexpected) solutions, and challenges the reader to pursue further active research in computer science.

      Gems of theoretical computer science