Tropical Circuit Complexity Limits of Pure Dynamic Programming /

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...

Descripció completa

Guardat en:
Dades bibliogràfiques
Autor principal: Jukna, Stasys (Autor)
Autor corporatiu: SpringerLink (Online service)
Format: Electrònic eBook
Idioma:anglès
Publicat: Cham : Springer International Publishing : Imprint: Springer, 2023.
Edició:1st ed. 2023.
Col·lecció:SpringerBriefs in Mathematics,
Matèries:
Accés en línia:https://doi.org/10.1007/978-3-031-42354-3
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-42354-3
003 DE-He213
005 20260906075745.0
007 cr nn 008mamaa
008 231106s2023 sz | o |||| 0|eng d
020 |a 9783031423543  |9 978-3-031-42354-3 
024 7 |a 10.1007/978-3-031-42354-3  |2 doi 
050 4 |a QA297.4 
072 7 |a PBD  |2 bicssc 
072 7 |a MAT008000  |2 bisacsh 
072 7 |a PBD  |2 thema 
082 0 4 |a 511.1  |2 23 
100 1 |a Jukna, Stasys.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Tropical Circuit Complexity  |h [electronic resource] :  |b Limits of Pure Dynamic Programming /  |c by Stasys Jukna. 
250 |a 1st ed. 2023. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2023. 
300 |a 1 online resource (IX, 129 p. 19 illus.). 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
341 0 |b Table of contents navigation  |2 onix 
341 0 |b Single logical reading order  |2 onix 
341 0 |b Short alternative textual descriptions  |2 onix 
341 0 |b Use of colour is Not sole means of conveying information  |2 onix 
341 0 |b Use of high contrast between text and background colour  |2 onix 
341 0 |b Next / Previous structural navigation  |2 onix 
341 0 |b All Non-decorative content supports reading without sight  |2 onix 
347 |a text file  |b PDF  |2 rda 
490 1 |a SpringerBriefs in Mathematics,  |x 2191-8201 
505 0 |a Chapter. 1. Basics -- Chapter. 2. Combinatorial Bounds -- Chapter. 3. Rectangle Bounds -- Chapter. 4. Bounds for Approximating Circuits -- Chapter. 5. Tropical Branching Programs -- Chapter. 6. Extended Tropical Circuits. 
520 |a 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. 
532 8 |a Accessibility summary: This PDF does Not fully comply with PDF/UA standards but does include limited screen reader support, descriptions for Non-text content (such as images and graphs), bookmarks for easy navigation, and searchable, selectable text. Users of assistive technologies may experience difficulty navigating or interpreting content in this document. We recognise the importance of accessibility and welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us via https://www.springernature.com/gp/info/accessibility 
532 8 |a Inaccessible, or known limited accessibility 
532 8 |a No reading system accessibility options actively disabled 
532 8 |a Publisher contact for further accessibility information: accessibilitysupport@springernature.com 
588 |a Print version record. 
650 0 |a Discrete mathematics. 
650 0 |a Computational complexity. 
650 0 |a Mathematical optimization. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Discrete Mathematics. 
650 2 4 |a Computational Complexity. 
650 2 4 |a Discrete Optimization. 
650 2 4 |a Mathematical Applications in Computer Science. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031423536 
776 0 8 |i Printed edition:  |z 9783031423550 
830 0 |a SpringerBriefs in Mathematics,  |x 2191-8201 
856 4 0 |u https://doi.org/10.1007/978-3-031-42354-3 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713)