|
|
|
|
LEADER |
04237nam a2200613 4500 |
001 |
978-3-540-45066-5 |
003 |
DE-He213 |
005 |
20191023181110.0 |
007 |
cr nn 008mamaa |
008 |
121227s2003 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540450665
|9 978-3-540-45066-5
|
024 |
7 |
|
|a 10.1007/3-540-45066-1
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.6-76.66
|
072 |
|
7 |
|a UM
|2 bicssc
|
072 |
|
7 |
|a COM051000
|2 bisacsh
|
072 |
|
7 |
|a UM
|2 thema
|
082 |
0 |
4 |
|a 005.11
|2 23
|
245 |
1 |
0 |
|a Discrete Mathematics and Theoretical Computer Science
|h [electronic resource] :
|b 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings /
|c edited by Cristian S. Calude, Michael J. Dinneen, Vincent Vajnovszki.
|
250 |
|
|
|a 1st ed. 2003.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2003.
|
300 |
|
|
|a IX, 300 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2731
|
505 |
0 |
|
|a 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.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Coding theory.
|
650 |
|
0 |
|a Information theory.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Computer science-Mathematics.
|
650 |
1 |
4 |
|a Programming Techniques.
|0 http://scigraph.springernature.com/things/product-market-codes/I14010
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 http://scigraph.springernature.com/things/product-market-codes/I16021
|
650 |
2 |
4 |
|a Data Structures.
|0 http://scigraph.springernature.com/things/product-market-codes/I15017
|
650 |
2 |
4 |
|a Coding and Information Theory.
|0 http://scigraph.springernature.com/things/product-market-codes/I15041
|
650 |
2 |
4 |
|a Theory of Computation.
|0 http://scigraph.springernature.com/things/product-market-codes/I16005
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|0 http://scigraph.springernature.com/things/product-market-codes/I17028
|
700 |
1 |
|
|a Calude, Cristian S.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Dinneen, Michael J.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Vajnovszki, Vincent.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662181331
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540405054
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2731
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-45066-1
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|