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.).

By: DMTCS 2003 (2003 : Dijon, France)
Contributor(s): Calude, Cristian, 1952- | Dinneen, M. J, 1957- | Vajnovszki, Vincent
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 2731.Publisher: Berlin ; New York : Springer, ©2003Description: 1 online resource (viii, 300 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540450665; 3540450661Subject(s): Combinatorial analysis -- Congresses | Computational complexity -- Congresses | Logic, Symbolic and mathematical -- Congresses | Combinatorial analysis | Computational complexity | Logic, Symbolic and mathematicalGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Discrete mathematics and theoretical computer science.DDC classification: 511/.6 LOC classification: QA164 | .D62 2003Online resources: Click here to access online
Contents:
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.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

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.

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.

There are no comments for this item.

to post a comment.

Powered by Koha