|
|
|
|
LEADER |
02844nam a22005535i 4500 |
001 |
11409 |
003 |
DE-He213 |
005 |
20130725203159.0 |
007 |
cr nn 008mamaa |
008 |
101203s2010 gw | s |||| 0|eng d |
020 |
# |
# |
|a 9783642174933
|9 978-3-642-17493-3
|
024 |
7 |
# |
|a 10.1007/978-3-642-17493-3
|2 doi
|
050 |
# |
4 |
|a QA76.9.A43
|
072 |
# |
7 |
|a UMB
|2 bicssc
|
072 |
# |
7 |
|a COM051300
|2 bisacsh
|
082 |
0 |
4 |
|a 005.1
|2 23
|
100 |
1 |
# |
|a Raman, Venkatesh.
|e editor.
|
245 |
1 |
0 |
|a Parameterized and Exact Computation
|b 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings /
|c edited by Venkatesh Raman, Saket Saurabh.
|h [electronic resource] :
|
264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
300 |
# |
# |
|a X, 239p.
|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 6478
|x 0302-9743 ;
|
520 |
# |
# |
|a This book constitutes the refereed best selected papers of the 5th International Symposium on Parameterized and Exact Computation, IPEC 2010, held in Chennai, India, in December 2010. The 19 revised full papers presented were carefully reviewed and selected from 32 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms; parameterized complexity theory; relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact computation; implementation issues of parameterized and exact algorithms; fixed-parameter approximation; fast approximation in exponential time; kernelization lower and upper bounds.
|
650 |
# |
0 |
|a Computer science.
|
650 |
# |
0 |
|a Information theory.
|
650 |
# |
0 |
|a Computer software.
|
650 |
# |
0 |
|a Computational complexity.
|
650 |
# |
0 |
|a Algebra
|x Data processing.
|
650 |
# |
0 |
|a Algorithms.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
700 |
1 |
# |
|a Saurabh, Saket.
|e editor.
|
710 |
2 |
# |
|a SpringerLink (Online service)
|
773 |
0 |
# |
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642174926
|
830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 6478
|x 0302-9743 ;
|
856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-17493-3
|
912 |
# |
# |
|a ZDB-2-SCS
|
912 |
# |
# |
|a ZDB-2-LNC
|
950 |
# |
# |
|a Computer Science (Springer-11645)
|