Imatge de la portada

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:
Discrete mathematics.
Computational complexity.
Mathematical optimization.
Computer science > Mathematics.
Discrete Mathematics.
Computational Complexity.
Discrete Optimization.
Mathematical Applications in Computer Science.
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!
Taula de continguts:
  • 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.

Ítems similars