Discrete mathematics and theoretical computer science : 4th international conference, DMTCS 2003, Dijon, France, July 7-12, 2003 : proceedings
Enregistré dans:
| 企業作者: | |
|---|---|
| 其他作者: | , , |
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| 叢編: | Lecture notes in computer science
2731 |
| 主題: | |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Discrete mathematics and theoretical computer science, 4th international conference, DMTCS 2003, Dijon, France, July 7-12, 2003, proceedings, Cristian S. Calude, Michael J. Dinneen, Vincent Vajnovszki (eds.), Berlin, Springer, 2003, 1 vol. (VIII-300 p.), Lecture notes in computer science, 3-540-40505-4 • Discrete Mathematics and Theoretical Computer Science, Texte imprimé, 9783662181331 |
書本目錄:
- 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.