Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 54,42
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 69,39
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 138 pages. 9.25x6.10x0.30 inches. In Stock.
Idioma: Inglés
Publicado por Springer International Publishing, 2023
ISBN 10: 3031423534 ISBN 13: 9783031423536
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 48,14
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents an enticing introduction to tropical circuits and their use as a rigorous mathematical model for dynamic programming (DP), which is one of the most fundamental algorithmic paradigms for solving combinatorial, discrete optimization problems.In DP, an optimization problem is broken up into smaller subproblems that are solved recursively. Many classical DP algorithms are pure in that they only use the basic (min,+) or (max,+) operations in their recursion equations. In tropical circuits, these operations are used as gates. Thanks to the rigorous combinatorial nature of tropical circuits, elements from the Boolean and arithmetic circuit complexity can be used to obtain lower bounds for tropical circuits, which play a crucial role in understanding the limitations and capabilities of these computational models. This book aims to offer a toolbox for proving lower bounds on the size of tropical circuits.In this work, the reader will find lower-bound ideas and methods that have emerged in the last few years, with detailed proofs. Largely self-contained, this book is meant to be approachable by graduate students in mathematics and computer science with a special interest in circuit complexity.
Librería: preigu, Osnabrück, Alemania
EUR 45,85
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Tropical Circuit Complexity | Limits of Pure Dynamic Programming | Stasys Jukna | Taschenbuch | SpringerBriefs in Mathematics | ix | Englisch | 2023 | Springer | EAN 9783031423536 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 42,22
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 63,81
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 140.
Idioma: Inglés
Publicado por Springer International Publishing Okt 2023, 2023
ISBN 10: 3031423534 ISBN 13: 9783031423536
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 48,14
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book presents an enticing introduction to tropical circuits and their use as a rigorous mathematical model for dynamic programming (DP), which is one of the most fundamental algorithmic paradigms for solving combinatorial, discrete optimization problems.In DP, an optimization problem is broken up into smaller subproblems that are solved recursively. Many classical DP algorithms are pure in that they only use the basic (min,+) or (max,+) operations in their recursion equations. In tropical circuits, these operations are used as gates. Thanks to the rigorous combinatorial nature of tropical circuits, elements from the Boolean and arithmetic circuit complexity can be used to obtain lower bounds for tropical circuits, which play a crucial role in understanding the limitations and capabilities of these computational models. This book aims to offer a toolbox for proving lower bounds on the size of tropical circuits.In this work, the reader will find lower-bound ideas and methods that have emerged in the last few years, with detailed proofs. Largely self-contained, this book is meant to be approachable by graduate students in mathematics and computer science with a special interest in circuit complexity. 140 pp. Englisch.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 65,01
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 140.
Idioma: Inglés
Publicado por Springer International Publishing, 2023
ISBN 10: 3031423534 ISBN 13: 9783031423536
Librería: moluna, Greven, Alemania
EUR 43,98
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents tropical circuits and their use in combinatorial, discrete optimization problemsOffers a toolbox for proving lower bounds for tropical circuits, facilitating the study of their complexityGathers ideas and methods that have, until n.
Idioma: Inglés
Publicado por Springer, Springer Nov 2023, 2023
ISBN 10: 3031423534 ISBN 13: 9783031423536
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 48,14
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book presents an enticing introduction to tropical circuits and their use as a rigorous mathematical model for dynamic programming (DP), which is one of the most fundamental algorithmic paradigms for solving combinatorial, discrete optimization problems.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 140 pp. Englisch.