ENGLISH

Discrete Mathematics and Theoretical Computer Science: 4th International Conference, DMTCS 2003 Dijon, France, July 7–12, 2003 Proceedings

By Cristian S. Calude , Michael J. Dinneen , Gregory Chaitin (auth.) , Vincent Vajnovszki (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2003
ISBN
3540405054, 9783540405054
DOI
10.1007/3-540-45066-1
LCC
QA164 .D62 2003
Open Library ID
OL22543346M
Language
english
Format
PDF
Filesize
3 MB (3498010 bytes)
Series
Lecture Notes in Computer Science 2731
Edition
1
Pages
300\309
Library
Kolxo3
Time added
2009-12-04 00:34:26
Algorithm Analysis and Problem Complexity; Data St

Description

This book constitutes the refereed proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science, DMTCS 2003, held in Dijon, France in July 2003. The 18 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 35 submissions. A broad variety of topics in discrete mathematics and the theory of computing is addressed including information theory, coding, algorithms, complexity, automata, computational mathematics, combinatorial computations, graph computations, algorithmic geometry, relational methods, game-theoretic methods, combinatorial optimization, finite state systems, etc.

Similar books