| 000 | 01105nam a2200313 u 4500 | ||
|---|---|---|---|
| 001 | 10033321 | ||
| 003 | upatras | ||
| 005 | 20210117195322.0 | ||
| 008 | 991029s1999 us eng | ||
| 020 | _a038794883X | ||
| 040 |
_aGR-PaULI _cGR-PaULI |
||
| 041 | 0 | _aeng | |
| 082 | 0 | 4 | _a511.3 |
| 100 | 1 |
_aDowney, R. G. _92510 |
|
| 245 | 1 | 0 |
_aParameterized complexity _cR. G. Downey and M. R. Fellows |
| 260 |
_aNew York _bSpringer _c1999 |
||
| 300 |
_axv, 533 p. _bfig. _c24 cm. |
||
| 490 | 0 | _aMonographs in computer science | |
| 504 | _aIncludes bibliographical references and index | ||
| 650 | 4 |
_aΛογική, Συμβολική και μαθηματική _9472 |
|
| 650 | 4 |
_aΑλγόριθμοι _91123 |
|
| 650 | 4 |
_aΠολυπλοκότητα _92511 |
|
| 700 | 1 |
_aFellows, M. R. _92512 |
|
| 760 | 0 | _aMonographs in computer science | |
| 942 |
_2ddc _cBK15 |
||
| 998 |
_cΠΑΝΑΓΟΠΟΥΛΟΥ _d2000-03 |
||
| 999 |
_c973 _d973 |
||