Synopsis "stacs 2004"

this book constitutes the refereed proceedings of the 21st annual symposium on theoretical aspects of computer science, stacs 2004, held in montpellier, france, in march 2004. the 54 revised full papers presented together with two invited contributions were carefully reviewed and selected from more than 200 submissions. the papers are organized in topical sections on structural complexity, graph algorithms, quantum computing, satisfiability - constraint satisfaction problems, scheduling, algorithms, networks, automata theory and words, path algorithms, cryptography, logic and formal languages, game theory and complexity, and algorithmic information.

Customers reviews

Have you read this book? Login to add your review.

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.

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