Logic and Complexity introduces some of the fundamental ideas of Logic for Computer Science, by explaining the classical notions of mathematical logic, alongside new ideas brought by complexity theory.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Part 1. Basic Model Theory and Computability Propositional logic Deduction systems First order logic Completeness of first-order logic Models of computation Recursion and decidability Incompleteness of Peano Arithmetic Part 2. Descriptive Complexity Complexity: time and space First order definability Inductive definitions and second order logic Models of parallel computations Space complexity: the classes L, FL, NL, PSPACE Definability of optimisation and counting problems Part 3. Approximation and classes beyond NP Probabilistic classes Probabilistic verification Approximation Classes above NP
Rare Book
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Condizione: new. Questo è un articolo print on demand. Codice articolo G7WIBLMVP5
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9781447110521_new
Quantità: Più di 20 disponibili
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Includes exercises at end of each chapterAuthors website will be maintained for corrections, exercises, remarks and updatesDescribes a logical approach to complexity theory, for computer scientistsPresents new material, close to the . Codice articolo 4183937
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new ideas brought by complexity theory such as NP-completeness, randomness and approximations, providing a better understanding for efficient algorithmic solutions to problems. Divided into three parts, it covers: -Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic. Recursive functions, Turing computability and decidability are also examined. -Descriptive Complexity - looking at the relationship between definitions of problems, queries, properties of programs and their computational complexity. -Approximation - explaining how some optimization problems and counting problems can be approximated according to their logical form. Logic is important in Computer Science, particularly for verification problems and database query languages such as SQL. Students and researchers in this field will find this book of great interest. 376 pp. Englisch. Codice articolo 9781447110521
Quantità: 2 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: Neu. Logic and Complexity | Michel De Rougemont (u. a.) | Taschenbuch | x | Englisch | 2012 | Springer London | EAN 9781447110521 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Codice articolo 106119062
Quantità: 5 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 376. Codice articolo 2658580875
Quantità: 4 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new ideas brought by complexity theory such as NP-completeness, randomness and approximations, providing a better understanding for efficient algorithmic solutions to problems.Divided into three parts, it covers: Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic. Recursive functions, Turing computability and decidability are also examined. Descriptive Complexity - looking at the relationship between definitions of problems, queries, properties of programs and their computational complexity. Approximation - explaining how some optimization problems and counting problems can be approximated according to their logical form.Logic is important in Computer Science, particularly for verification problems and database query languages such as SQL. Students and researchers in this field will find this book of great interest.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 376 pp. Englisch. Codice articolo 9781447110521
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new ideas brought by complexity theory such as NP-completeness, randomness and approximations, providing a better understanding for efficient algorithmic solutions to problems. Divided into three parts, it covers: -Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic. Recursive functions, Turing computability and decidability are also examined. -Descriptive Complexity - looking at the relationship between definitions of problems, queries, properties of programs and their computational complexity. -Approximation - explaining how some optimization problems and counting problems can be approximated according to their logical form. Logic is important in Computer Science, particularly for verification problems and database query languages such as SQL. Students and researchers in this field will find this book of great interest. Codice articolo 9781447110521
Quantità: 1 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 376 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Codice articolo 51011668
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 376. Codice articolo 1858580865
Quantità: 4 disponibili