Items related to Space in Weak Propositional Proof Systems
Synopsis
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 in theoretical computer science, in particular computational complexity.
"synopsis" may belong to another edition of this title.
About the Author
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.
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2018
- ISBN 10 3319734520
- ISBN 13 9783319734521
- BindingHardcover
- LanguageEnglish
- Edition number1
- Number of pages147
Other Popular Editions of the Same Title
Search results for Space in Weak Propositional Proof Systems
Seller Image
Space in Weak Propositional Proof Systems
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 30584423-n
Quantity: Over 20 available
Stock Image
Space in Weak Propositional Proof Systems
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020104443
Quantity: Over 20 available
Seller Image
Space in Weak Propositional Proof Systems
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 30584423
Quantity: Over 20 available
Stock Image
Space in Weak Propositional Proof Systems
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783319734521_new
Quantity: Over 20 available
Seller Image
Space in Weak Propositional Proof Systems
Published by
Berlin Springer International Publishing Springer Jan 2018, 2018
ISBN 10: 3319734520
ISBN 13: 9783319734521
New
Buch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 in theoretical computer science, in particular computational complexity. 130 pp. Englisch. Seller Inventory # 9783319734521
Quantity: 2 available
Seller Image
Space in Weak Propositional Proof Systems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 30584423-n
Quantity: Over 20 available
Stock Image
Space in Weak Propositional Proof Systems
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 26384090301
Quantity: 4 available
Seller Image
Space in Weak Propositional Proof Systems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 30584423
Quantity: Over 20 available
Stock Image
Space in Weak Propositional Proof Systems
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand. Seller Inventory # 378765154
Quantity: 4 available
Seller Image
Space in Weak Propositional Proof Systems
Published by
Springer, Berlin, Springer International Publishing, Springer, 2018
ISBN 10: 3319734520
ISBN 13: 9783319734521
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 in theoretical computer science, in particular computational complexity. Seller Inventory # 9783319734521
Quantity: 2 available