Kniha Tropical Circuit Complexity Stasys Jukna

Tropical Circuit Complexity

Limits of Pure Dynamic Programming

Autor: Stasys Jukna
Jazyk: Angličtina
Vazba: Brožovaná
Vydavatel: Springer, Berlin
Dostupnost: Skladem u dodavatele
Odesíláme za 5-8 dnů
1 032
This book presents an enticing introduction to tropical circuits and their use as a rigorous mathema...

Informace o knize

Autor
Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
2023
Stránek
119
EAN
9783031423536
Enbook ID
43830179
Vydavatel
Hmotnost
204
Rozměry
155 x 235

Kompletní popis

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.

Mohlo by vás zajímat

1 499

Retirement

Peter K Phd Rimbach
733

Shad's Awakening

Helmut W Horchler
314
460

Currency Wars III

Song Hongbing
771

Zákaznicí kteří koupili tuto knihu koupili také

Schock-Zeiten

Alexander Hagelüken
359