|
|
|
|
| LEADER |
02805nam a22005895i 4500 |
| 001 |
10803 |
| 003 |
DE-He213 |
| 005 |
20130725200304.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100531s2010 gw | s |||| 0|eng d |
| 020 |
# |
# |
|a 9783642135620
|9 978-3-642-13562-0
|
| 024 |
7 |
# |
|a 10.1007/978-3-642-13562-0
|2 doi
|
| 050 |
# |
4 |
|a QA75.5-76.95
|
| 072 |
# |
7 |
|a UY
|2 bicssc
|
| 072 |
# |
7 |
|a UYA
|2 bicssc
|
| 072 |
# |
7 |
|a COM014000
|2 bisacsh
|
| 072 |
# |
7 |
|a COM031000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 100 |
1 |
# |
|a Kratochvl̕, Jan.
|e editor.
|
| 245 |
1 |
0 |
|a Theory and Applications of Models of Computation
|b 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings /
|c edited by Jan Kratochvl̕, Angsheng Li, JiY ̕Fiala, Petr Kolman.
|h [electronic resource] :
|
| 264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
| 300 |
# |
# |
|a XIV, 480p. 91 illus.
|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,
|v 6108
|x 0302-9743 ;
|
| 520 |
# |
# |
|a This book constitutes the refereed proceedings of the 7th International Conference on Theory and Applications of Models of Computation, TAMC 2010, held in Prague, Czech Republic, in June 2010. The 35 revised full papers presented together with 5 contributions of special sessions as well as 2 plenary talks were carefully reviewed and selected from 76 submissions. The papers address the three main themes of the conference which were computability, complexity, and algorithms and present current research in these fields with aspects to theoretical computer science, algorithmic mathematics, and applications to the physical sciences.
|
| 650 |
# |
0 |
|a Computer science.
|
| 650 |
# |
0 |
|a Information theory.
|
| 650 |
# |
0 |
|a Computer software.
|
| 650 |
# |
0 |
|a Logic design.
|
| 650 |
# |
0 |
|a Computational complexity.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 700 |
1 |
# |
|a Li, Angsheng.
|e editor.
|
| 700 |
1 |
# |
|a Fiala, JiY.̕
|e editor.
|
| 700 |
1 |
# |
|a Kolman, Petr.
|e editor.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642135613
|
| 830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 6108
|x 0302-9743 ;
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-13562-0
|
| 912 |
# |
# |
|a ZDB-2-SCS
|
| 912 |
# |
# |
|a ZDB-2-LNC
|
| 950 |
# |
# |
|a Computer Science (Springer-11645)
|