Hardcover. Condition: Good. Dust Jacket Condition: No Dustjacket. Later Edition. ISBN . Hardback. No statement of later printing on copyright page. No dustjacket; bound in black boards with gold lettering. Translated from Russian Soviet era; slight wear to corners and edges; lettering partially rubbed off of spine and front board; slight spine cock; slight browning and dustsoiling to edges; otherwise tight, sound and unmarked in Good condition. No Signature.
Language: German
Published by Frech; 1. Edition (10. August 2022), 2022
ISBN 10: 3735890008 ISBN 13: 9783735890009
Seller: Rarewaves.com UK, London, United Kingdom
Paperback. Condition: New.
Language: German
Published by Frech; 2. Edition (9. August 2023), 2023
ISBN 10: 3735891101 ISBN 13: 9783735891105
Seller: Rarewaves.com UK, London, United Kingdom
Paperback. Condition: New.
Weimar 1907, 411 pp.,plate c110.
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Advanced Tools and Methods for Treewidth-Based Problem Solving | M. Hecher | Taschenbuch | Englisch | 2022 | IOS Press | EAN 9781643683447 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book, Advanced Tools and Methods for Treewidth-Based Problem Solving, contains selected results from the author's PhD studies, which were carried out from 2015 to 2021. For his PhD thesis, Markus Hecher received the EurAI Dissertation Award 2021 and the GI Dissertation Award 2021, amongst others.The aim of the book is to present a new toolkit for using the structural parameter of treewidth to solve problems in knowledge representation and reasoning (KR) and artificial intelligence (AI), thereby establishing both theoretical upper and lower bounds, as well as methods to deal with treewidth efficiently in practice. The key foundations outlined in the book provide runtime lower bounds - under reasonable assumptions in computational complexity - for evaluating quantified Boolean formulas and logic programs which match the known upper bounds already published in 2004 and 2009. The general nature of the developed tools and techniques means that a wide applicability beyond the selected problems and formalisms tackled in the book is anticipated, and it is hoped that the book will serve as a starting point for future theoretical and practical investigations, which will no doubt establish further results and gain deeper insights.