Product Type
Condition
Binding
Collectible Attributes
Free Shipping
Seller Location
Seller Rating
Published by Springer, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Book
Condition: New.
Published by Springer, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book
Soft Cover. Condition: new.
Published by Springer, 2018
ISBN 10: 3319734520ISBN 13: 9783319734521
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book
Hardcover. Condition: new.
Published by Springer, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer, 2018
ISBN 10: 3319734520ISBN 13: 9783319734521
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Book
Condition: As New. Unread book in perfect condition.
Published by Springer, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer, 2018
ISBN 10: 3319734520ISBN 13: 9783319734521
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Berlin Springer International Publishing Springer Jan 2018, 2018
ISBN 10: 3319734520ISBN 13: 9783319734521
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Book Print on Demand
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.
Published by Springer International Publishing Jun 2019, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Book Print on Demand
Taschenbuch. 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. 148 pp. Englisch.
Published by Springer, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: GreatBookPricesUK, Castle Donington, DERBY, United Kingdom
Book
Condition: New.
Published by Springer-Verlag New York Inc, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: Revaluation Books, Exeter, United Kingdom
Book
Paperback. Condition: Brand New. reprint edition. 148 pages. 9.50x6.50x0.50 inches. In Stock.
Published by Springer, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: GreatBookPricesUK, Castle Donington, DERBY, United Kingdom
Book
Condition: As New. Unread book in perfect condition.
Published by Springer International Publishing, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book
Taschenbuch. 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.
Published by Springer, Berlin, Springer International Publishing, Springer, 2018
ISBN 10: 3319734520ISBN 13: 9783319734521
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book
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.
Published by Springer 2019-06, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: Chiron Media, Wallingford, United Kingdom
Book
PF. Condition: New.
Published by Springer International Publishing, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: moluna, Greven, Germany
Book Print on Demand
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Proof complexity is a research area that studies the concept of complexity from the point of view of logicBook offers a reader-friendly exposition of game-theoretic methods used in proof complexityAppropriate for rese.
Published by Springer International Publishing, 2018
ISBN 10: 3319734520ISBN 13: 9783319734521
Seller: moluna, Greven, Germany
Book Print on Demand
Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Proof complexity is a research area that studies the concept of complexity from the point of view of logicBook offers a reader-friendly exposition of game-theoretic methods used in proof complexityAppropriate for rese.
Published by Springer, 2019
ISBN 10: 3319892495ISBN 13: 9783319892498
Seller: dsmbooks, Liverpool, United Kingdom
Book
Paperback. Condition: New. New. book.