Stasys Jukna – författare
Visar alla böcker från författaren Stasys Jukna. Handla med fri frakt och snabb leverans.
11 produkter
Tropical Circuit Complexity
Limits of Pure Dynamic Programming
Av Stasys Jukna
Häftad, 2023
497 kr
Lägg i varukorg
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 …
Tropical Circuit Complexity
Limits of Pure Dynamic Programming
Av Stasys Jukna
E-bok, 2023
652 kr
Lägg i varukorg
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 …
Extremal Combinatorics
With Applications in Computer Science
Av Stasys Jukna
Inbunden, 2011
1095 kr
Lägg i varukorg
This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful …
Extremal Combinatorics
With Applications in Computer Science
Av Stasys Jukna
E-bok, 2011
981 kr
Lägg i varukorg
This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful …
Boolean Function Complexity
Advances and Frontiers
Av Stasys Jukna
Inbunden, 2012
1204 kr
Lägg i varukorg
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that …
Boolean Function Complexity
Advances and Frontiers
Av Stasys Jukna
E-bok, 2012
1141 kr
Lägg i varukorg
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that …
Extremal Combinatorics
With Applications in Computer Science
Av Stasys Jukna
Häftad, 2013
769 kr
Lägg i varukorg
This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful …
Boolean Function Complexity
Advances and Frontiers
Av Stasys Jukna
Häftad, 2014
877 kr
Lägg i varukorg
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that …
Extremal Combinatorics
With Applications in Computer Science
Av Stasys Jukna
E-bok, 2013
1148 kr
Lägg i varukorg
Combinatorial mathematics has been pursued since time immemorial, and at a reasonable scientific level at least since Leonhard Euler (1707-1783). It ren dered many services to both pure and applied mathematics. Then along came the prince of computer science with its many mathematical problems and …
Crashkurs Mathematik
für Informatiker
Av Stasys Jukna
Häftad, 2007
412 kr
Lägg i varukorg
Studierende, die ein Informatikstudium aufnehmen, brauchen zu Beginn vor allem eines: mathematische Grundkenntnisse. Dieser Crashkurs soll Studierenden im ersten Semester helfen, möglichst rechtzeitig diese Fähigkeiten zu erwerben.Durch viele motivierende Beispiele, erklärende Bilder und konkrete …
