| 000 | 00945nom a2200289 u 4500 | ||
|---|---|---|---|
| 001 | 10070625 | ||
| 003 | upatras | ||
| 005 | 20210117201621.0 | ||
| 008 | 090513s2005 eng | ||
| 020 | _a9780387268064 | ||
| 040 |
_aGR-PaULI _cGR-PaULI |
||
| 041 | 0 | _aeng | |
| 100 | 1 |
_aBurgin, Mark _967082 |
|
| 245 | 1 | 0 |
_aSuper-Recursive Algorithms _h[electronic resource] _cby Mark Burgin |
| 260 |
_aNew York, NY _bSpringer Science+Business Media Inc. _c2005 |
||
| 300 | _bv.: digital | ||
| 490 | 0 |
_aMonographs in Computer Science _x0172-603X |
|
| 650 | 4 |
_aInformation theory _913106 |
|
| 650 | 4 |
_aComputer software _924488 |
|
| 650 | 4 |
_aComputer Science _964565 |
|
| 650 | 4 |
_aTheory of Computation _964606 |
|
| 650 | 4 |
_aAlgorithm Analysis and Problem Complexity _964576 |
|
| 760 | 1 |
_aMonographs in Computer Science _x0172-603X |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/b138114 |
| 942 | _2ddc | ||
| 999 |
_c46870 _d46870 |
||