Algorithmics for Hard Problems by Juraj Hromkovi
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies.-
Information and Randomness
-
Universal Artificial Intelligence
-
Interactive Theorem Proving and Program Development
-
Graphs and Algorithms in Communication Networks
-
Computable Analysis
-
Models of Massive Parallelism
-
Structural Complexity I
-
The Resolution Calculus
-
Models of Computation
-
Dissemination of Information in Optical Networks:
-
A Practical Theory of Reactive Systems
-
Petri Net Synthesis
-
Grammatical Picture Generation
-
Temporal Logic and State Systems
-
Simulation Algorithms for Computational Systems Biology
-
Public-Key Cryptography
-
Communication Complexity and Parallel Computing
-
Boolean Functions and Computation Models
-
Verification of Reactive Systems
-
Theoretical Computer Science
-
Introduction to Circuit Complexity
-
Elements of Finite Model Theory
-
The Parametric Lambda Calculus
-
The Complexity Theory Companion
-
Introduction to Process Algebra
-
DNA Computing
-
Abstract Computing Machines
-
Design and Analysis of Randomized Algorithms
-
Dissemination of Information in Communication Networks
-
Formal Methods for Software Engineering
-
Complexity Theory and Cryptology
-
Parsing Schemata
Prof. Dr. Juraj Hromkovič lehrt und forscht an der ETH Zürich. Seit 2010 ist er Mitglied der Academia Europaea.
| SKU | Unavailable |
| ISBN 13 | 9783540441342 |
| ISBN 10 | 3540441344 |
| Title | Algorithmics for Hard Problems |
| Author | Juraj Hromkovi |
| Series | Texts In Theoretical Computer Science An Eatcs Series |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Springer |
| Year published | 2002-10-09 |
| Number of pages | 538 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |