Cover Image
Read Now

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

Bibliographic Details
Other Authors: Calude, Cristian S. (Editor), Dinneen, Michael J. (Editor), Vajnovszki, Vincent (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2003, 2003
Edition:1st ed. 2003
Series:Lecture Notes in Computer Science
Subjects:
Artificial Intelligence / Data Processing
Coding And Information Theory
Coding Theory
Programming Techniques
Computer Science
Computer Science / Mathematics
Computer Programming
Discrete Mathematics In Computer Science
Algorithms
Information Theory
Discrete Mathematics
Theory Of Computation
Data Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 03005nmm a2200421 u 4500
001 EB001884241
003 EBX01000000000000001047608
005 00000000000000.0
007 cr|||||||||||||||||||||
008 191115 ||| eng
020 |a 9783540450665 
100 1 |a Calude, Cristian S.  |e [editor] 
245 0 0 |a Discrete Mathematics and Theoretical Computer Science  |h Elektronische Ressource  |b 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings  |c edited by Cristian S. Calude, Michael J. Dinneen, Vincent Vajnovszki 
250 |a 1st ed. 2003 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2003, 2003 
300 |a IX, 300 p  |b online resource 
505 0 |a Invited Papers -- Two Philosophical Applications of Algorithmic Information Theory -- Covering and Secret Sharing with Linear Codes -- Combinatorial Problems Arising in SNP and Haplotype Analysis -- Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey -- Generating Gray Codes in O(1) Worst-Case Time per Word -- Contributed Papers -- Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems -- Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata -- On the Order Dual of a Riesz Space -- A Finite Complete Set of Equations Generating Graphs -- ECO Method and the Exhaustive Generation of Convex Polyominoes -- Regular Expressions with Timed Dominoes -- On Infinitary Rational Relations and Borel Sets -- Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems -- On Functions and Relations -- Paths Coloring Algorithms in Mesh Networks -- Finite State Strategies in One Player McNaughton Games -- On Algebraic Expressions of Series-Parallel and Fibonacci Graphs -- Boolean NP-Partitions and Projective Closure -- On Unimodality of Independence Polynomials of Some Well-Covered Trees -- A Coloring Algorithm for Finding Connected Guards in Art Galleries -- An Analysis of Quantified Linear Programs -- An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique -- On the Monotonic Computability of Semi-computable Real Numbers 
653 |a Artificial intelligence / Data processing 
653 |a Coding and Information Theory 
653 |a Coding theory 
653 |a Programming Techniques 
653 |a Computer science 
653 |a Computer science / Mathematics 
653 |a Computer programming 
653 |a Discrete Mathematics in Computer Science 
653 |a Algorithms 
653 |a Information theory 
653 |a Discrete mathematics 
653 |a Theory of Computation 
653 |a Data Science 
700 1 |a Dinneen, Michael J.  |e [editor] 
700 1 |a Vajnovszki, Vincent  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/3-540-45066-1 
856 4 0 |u https://doi.org/10.1007/3-540-45066-1?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.11 

Similar Items