|
|
|
|
| LEADER |
02806nam a22005415i 4500 |
| 001 |
7431 |
| 003 |
DE-He213 |
| 005 |
20130725192912.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2009 gw | s |||| 0|eng d |
| 020 |
# |
# |
|a 9783642034091
|9 978-3-642-03409-1
|
| 024 |
7 |
# |
|a 10.1007/978-3-642-03409-1
|2 doi
|
| 050 |
# |
4 |
|a QA75.5-76.95
|
| 072 |
# |
7 |
|a UYZG
|2 bicssc
|
| 072 |
# |
7 |
|a COM037000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 100 |
1 |
# |
|a KutyBowski, MirosBaw.
|e editor.
|
| 245 |
1 |
0 |
|a Fundamentals of Computation Theory
|b 17th International Symposium, FCT 2009, WrocBaw, Poland, September 2-4, 2009. Proceedings /
|c edited by MirosBaw KutyBowski, Witold Charatonik, Maciej G bala.
|h [electronic resource] :
|
| 264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2009.
|
| 300 |
# |
# |
|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 5699
|x 0302-9743 ;
|
| 520 |
# |
# |
|a This book constitutes the refereed proceedings of the 17th International Symposium Fundamentals of Computation Theory, FCT 2009, held in Wroclaw, Poland in August 2009. The 29 revised full papers were carefully reviewed and selected from 67 submissions. The papers address all current topics in computation theory such as automata and formal languages, design and analysis of algorithms, computational and structural complexity, semantics, logic, algebra and categories in computer science, circuits and networks, learning theory, specification and verification, parallel and distributed systems, concurrency theory, cryptography and cryptograhic protocols, approximation and randomized algorithms, computational geometry, quantum computation and information, bio-inspired computation.
|
| 650 |
# |
0 |
|a Computer science.
|
| 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 Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 700 |
1 |
# |
|a Charatonik, Witold.
|e editor.
|
| 700 |
1 |
# |
|a G bala, Maciej.
|e editor.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642034084
|
| 830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 5699
|x 0302-9743 ;
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-03409-1
|
| 912 |
# |
# |
|a ZDB-2-SCS
|
| 912 |
# |
# |
|a ZDB-2-LNC
|
| 950 |
# |
# |
|a Computer Science (Springer-11645)
|