000			03608nam a22005895i 4500
001			978-3-540-45066-5
003			DE-He213
005			20160624101956.0
007			cr nn 008mamaa
008			121227s2003 gw | s |||| 0|eng d
020			_a9783540450665 _9978-3-540-45066-5
024	7		_a10.1007/3-540-45066-1 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
245	1	0	_aDiscrete Mathematics and Theoretical Computer Science _h[electronic resource] : _b4th International Conference, DMTCS 2003 Dijon, France, July 7–12, 2003 Proceedings / _cedited by Cristian S. Calude, Michael J. Dinneen, Vincent Vajnovszki.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003.
300			_aIX, 300 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v2731
505	0		_aInvited 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.
650		0	_aComputer science.
650		0	_aData structures (Computer science).
650		0	_aCoding theory.
650		0	_aInformation theory.
650		0	_aComputer software.
650		0	_aComputational complexity.
650		0	_aComputer graphics.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aData Structures.
650	2	4	_aCoding and Information Theory.
650	2	4	_aTheory of Computation.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aComputer Graphics.
700	1		_aCalude, Cristian S. _eeditor.
700	1		_aDinneen, Michael J. _eeditor.
700	1		_aVajnovszki, Vincent. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540405054
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v2731
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-45066-1
942			_2EBK5155 _cEBK
999			_c34449 _d34449