Atnaujinkite slapukų nuostatas

El. knyga: Tropical Circuit Complexity: Limits of Pure Dynamic Programming

  • Formatas: EPUB+DRM
  • Serija: SpringerBriefs in Mathematics
  • Išleidimo metai: 06-Nov-2023
  • Leidėjas: Springer International Publishing AG
  • Kalba: eng
  • ISBN-13: 9783031423543
Kitos knygos pagal šią temą:
Tropical Circuit Complexity: Limits of Pure Dynamic ProgrammingDidesnis paveikslėlis
  • Formatas: EPUB+DRM
  • Serija: SpringerBriefs in Mathematics
  • Išleidimo metai: 06-Nov-2023
  • Leidėjas: Springer International Publishing AG
  • Kalba: eng
  • ISBN-13: 9783031423543
Kitos knygos pagal šią temą:

DRM apribojimai

  • Kopijuoti:

    neleidžiama

  • Spausdinti:

    neleidžiama

  • El. knygos naudojimas:

    Skaitmeninių teisių valdymas (DRM)
    Leidykla pateikė šią knygą šifruota forma, o tai reiškia, kad norint ją atrakinti ir perskaityti reikia įdiegti nemokamą programinę įrangą. Norint skaityti šią el. knygą, turite susikurti Adobe ID . Daugiau informacijos  čia. El. knygą galima atsisiųsti į 6 įrenginius (vienas vartotojas su tuo pačiu Adobe ID).

    Reikalinga programinė įranga
    Norint skaityti šią el. knygą mobiliajame įrenginyje (telefone ar planšetiniame kompiuteryje), turite įdiegti šią nemokamą programėlę: PocketBook Reader (iOS / Android)

    Norint skaityti šią el. knygą asmeniniame arba „Mac“ kompiuteryje, Jums reikalinga  Adobe Digital Editions “ (tai nemokama programa, specialiai sukurta el. knygoms. Tai nėra tas pats, kas „Adobe Reader“, kurią tikriausiai jau turite savo kompiuteryje.)

    Negalite skaityti šios el. knygos naudodami „Amazon Kindle“.

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.
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.
Stasys Jukna is an Affiliated Researcher at Vilnius University, Lithuania. His research interests lie between mathematics and theoretical computer sciences, with a focus on proving lower bounds on circuit complexity. Dr. Jukna has authored numerous books, including "Extremal Combinatorics" and "Boolean Function Complexity," published by Springer.
Daugiau apie elektronines knygas Daugiau apie elektronines knygas
Pastovi nuoroda: https://www.kriso.lt/db/97830314235436e.html