|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-319-13524-3 |
003 |
DE-He213 |
005 |
20230330061858.0 |
007 |
cr nn 008mamaa |
008 |
141202s2014 sz | s |||| 0|eng d |
020 |
|
|
|a 9783319135243
|9 978-3-319-13524-3
|
024 |
7 |
|
|a 10.1007/978-3-319-13524-3
|2 doi
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UY
|2 bicssc
|
072 |
|
7 |
|a COM014000
|2 bisacsh
|
072 |
|
7 |
|a UY
|2 thema
|
082 |
0 |
4 |
|a 004
|2 23
|
245 |
1 |
0 |
|a Parameterized and Exact Computation
|h [electronic resource] :
|b 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers /
|c edited by Marek Cygan, Pinar Heggernes.
|
250 |
|
|
|a 1st ed. 2014.
|
264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2014.
|
300 |
|
|
|a IX, 343 p. 37 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 Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 8894
|
505 |
0 |
|
|a Fixed-parameter tractability results -- Parameterized complexity theory -- Relationship between parameterized complexity and traditional complexity classifications.-Applications of parameterized and exact exponential-time computation.- Implementation issues of parameterized and exact exponential-time algorithms.
|
520 |
|
|
|a This book constitutes the thoroughly refereed post-conference proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, in Wroclaw, Poland, in September 2014. The 27 revised full papers presented together with one invited paper were carefully reviewed and selected from 42 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results; parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact exponential-time computation; and implementation issues of parameterized and exact exponential-time algorithms.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer science-Mathematics.
|
650 |
|
0 |
|a Discrete mathematics.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Mathematical Applications in Computer Science.
|
700 |
1 |
|
|a Cygan, Marek.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Heggernes, Pinar.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319135250
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319135236
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 8894
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-319-13524-3
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|