Custom cover image
Custom cover image

Discrete Mathematics and Theoretical Computer Science : 4th International Conference, DMTCS 2003 Dijon, France, July 7–12, 2003 Proceedings / edited by Cristian S. Calude, Michael J. Dinneen, Vincent Vajnovszki

By: Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Lecture notes in computer science ; 2731Publisher: Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2003Description: Online-RessourceISBN:
  • 9783540450665
Other title:
  • DMTCS 2003
Subject(s): Genre/Form: Additional physical formats: 9783540405054 | Buchausg. u.d.T.: Discrete mathematics and theoretical computer science. Berlin : Springer, 2003. VIII, 300 S.DDC classification:
  • 511/.6
  • 511.1 22/ger
  • 005.11 23
MSC: MSC: *00B25 | 68-06 | 68Qxx | 68RxxDOI: DOI: 10.1007/3-540-45066-1Online resources: Summary: 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.PPN: PPN: 1649241089Package identifier: Produktsigel: ZDB-2-BAE | ZDB-2-SXCS | ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SEB
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT