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

Table des matières

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.

Détails du produit

• Collaboration: Cristian S. Calude (Editeur), Michael J. Dinneen (Editeur), Vincent Vajnovszki (Editeur)
• Edition: Springer, Berlin
• Langues: Anglais
• Format d'édition: Livre de poche
• Sortie: 27.06.2003
• EAN: 9783540405054
• ISBN: 978-3-540-40505-4
• Pages: 300
• Poids: 445 g
• Illustrations: IX, 300 p.
• Thème: Lecture Notes in Computer Science
• Catégories: Sciences naturelles, médecine, informatique, technique > Informatique, ordinateurs > Informatique; C, Data Science, Algorithms, Diskrete Mathematik, Mathematik für Informatiker, computer science, Theory of Computation, Discrete Mathematics in Computer Science, Programming Techniques, Discrete Mathematics, Computer programming, Computers, Algorithms & data structures, Coding and Information Theory, Information theory, Coding theory & cryptology, Mathematical theory of computation, Coding theory, Computer science—Mathematics, Maths for computer scientists, Algorithm Analysis and Problem Complexity, Data structures (Computer science), Data Structures