Tropical circuit complexity : limits of pure dynamic programming / Stasys Jukna.
2023
T57.83
Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Tropical circuit complexity : limits of pure dynamic programming / Stasys Jukna.
Author
Jukna, Stasys, 1953- author.
ISBN
9783031423543 (electronic bk.)
3031423542 (electronic bk.)
3031423534
9783031423536
3031423542 (electronic bk.)
3031423534
9783031423536
Published
Cham : Springer, [2023]
Copyright
©2023
Language
English
Description
1 online resource (ix, 129 pages) : illustrations.
Item Number
10.1007/978-3-031-42354-3 doi
Call Number
T57.83
Dewey Decimal Classification
519.7/03
Summary
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.
Note
Description based upon print version of record.
Bibliography, etc. Note
Includes bibliographical references.
Access Note
Access limited to authorized users.
Series
SpringerBriefs in mathematics.
Available in Other Form
Tropical Circuit Complexity
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources
Table of Contents
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.
Chapter. 2. Combinatorial Bounds
Chapter. 3. Rectangle Bounds
Chapter. 4. Bounds for Approximating Circuits
Chapter. 5. Tropical Branching Programs
Chapter. 6. Extended Tropical Circuits.