Space in Weak Propositional Proof Systems
Autor Ilario Bonacinaen Limba Engleză Hardback – 24 ian 2018
The book is appropriate for researchers in theoretical computer science, in particular computational complexity.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 318.60 lei 6-8 săpt. | |
Springer International Publishing – 7 iun 2019 | 318.60 lei 6-8 săpt. | |
Hardback (1) | 324.74 lei 6-8 săpt. | |
Springer International Publishing – 24 ian 2018 | 324.74 lei 6-8 săpt. |
Preț: 324.74 lei
Preț vechi: 405.93 lei
-20% Nou
Puncte Express: 487
Preț estimativ în valută:
62.17€ • 64.62$ • 51.54£
62.17€ • 64.62$ • 51.54£
Carte tipărită la comandă
Livrare economică 05-19 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319734521
ISBN-10: 3319734520
Pagini: 130
Ilustrații: XVII, 130 p. 15 illus., 8 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.39 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3319734520
Pagini: 130
Ilustrații: XVII, 130 p. 15 illus., 8 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.39 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
Cuprins
Introduction.- Total Space in Resolution.- Space in Polynomial Calculus.- Space Lower Bounds: Applications.- A Postlude: SETH and Resolution Size.
Notă biografică
Ilario Bonacina did his PhD at the Computer Science Department at Sapienza Università di Roma under the supervision of Nicola Galesi. After a postdoc in the Theoretical Computer Science Group at KTH Royal Institute of Technology (Stockholm), he is currently a postdoc in the Computer Science Department at Universitat Politècnica de Catalunya (Barcelona). His research interests include computational complexity and mathematical logic.
Textul de pe ultima copertă
This book considers logical proof systems from the point of view of their space complexity. After an introduction to propositional proof complexity the author structures the book into three main parts. Part I contains two chapters on resolution, one containing results already known in the literature before this work and one focused on space in resolution, and the author then moves on to polynomial calculus and its space complexity with a focus on the combinatorial technique to prove monomial space lower bounds. The first chapter in Part II addresses the proof complexity and space complexity of the pigeon principles. Then there is an interlude on a new type of game, defined on bipartite graphs, essentially independent from the rest of the book, collecting some results on graph theory. Finally Part III analyzes the size of resolution proofs in connection with the Strong Exponential Time Hypothesis (SETH) in complexity theory.
The book is appropriate for researchers intheoretical computer science, in particular computational complexity.
Caracteristici
Proof complexity is a research area that studies the concept of complexity from the point of view of logic Book offers a reader-friendly exposition of game-theoretic methods used in proof complexity Appropriate for researchers in theoretical computer science, in particular computational complexity