你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Tropical Circuit Complexity: Limits of Pure Dynamic Programming
Type
Physical Book
Author
Publisher
Language
English
Pages
129
Format
Paperback
Dimensions
23.4x15.6x0.8 cm
Weight
0.20 kg.
ISBN13
9783031423536
Categories

Tropical Circuit Complexity: Limits of Pure Dynamic Programming

Stasys Jukna (Author) · Springer · Paperback

Tropical Circuit Complexity: Limits of Pure Dynamic Programming - Jukna, Stasys

Cheaper New Book Imported to Taiwan
Delivery: 13 Oct - 26 Oct Shipping: 12 to 16 business days.
NT$ 1,724
Faster New Book Imported to Taiwan
Delivery: 02 Oct - 12 Oct Shipping: 5 to 6 business days.
NT$ 2,128
NT$ 1,724

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

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

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews