000 | 01001 a2200301 4500 | ||
---|---|---|---|
001 | 10837 | ||
650 | 0 |
_91359 _aComputational complexity |
|
999 |
_c10837 _d784 |
||
003 | TR-AnTOB | ||
005 | 20200509110238.0 | ||
008 | 020826s2003 gw a b 001 0 eng | ||
010 | _a2002032405 | ||
020 | _a3540441344 (alk. paper) | ||
040 |
_aDLC _cDLC _dDLC |
||
041 | _aeng | ||
042 | _apcc | ||
050 | 0 |
_aQA76.58 _b.H76 2003 |
|
090 | _aQA76.58 .H76 2003 | ||
100 |
_aHromkoviƩc, Juraj, _d1958- _92330 |
||
245 | 0 |
_aAlgorithmics for hard problems : _bintroduction to combinatorial optimization, randomization, approximation, and heuristics / _cJuraj Hromkovic. |
|
250 | _a2nd ed. | ||
264 | 1 |
_aBerlin ; _aNew York : _bSpringer-Verlag, _c2003. |
|
300 |
_axiii, 544 p. : _bill. ; _c24 cm. |
||
490 | 0 | _aTexts in theoretical computer science | |
504 | _aIncludes bibliographical references (p. [511]-532) and index. | ||
650 | 0 |
_aParallel processing (Electronic computers) _91646 |
|
942 | _cBK |