|
|
|
|
| LEADER |
03069nam a22005175i 4500 |
| 001 |
978-3-319-13524-3 |
| 003 |
DE-He213 |
| 005 |
20151204165957.0 |
| 007 |
cr nn 008mamaa |
| 008 |
141202s2014 gw | 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
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UY
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 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.
|
| 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 Lecture Notes in Computer Science,
|x 0302-9743 ;
|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
|x Mathematics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Computer Science, general.
|
| 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 Math Applications in Computer Science.
|
| 700 |
1 |
|
|a Cygan, Marek.
|e editor.
|
| 700 |
1 |
|
|a Heggernes, Pinar.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319135236
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 8894
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-319-13524-3
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
