| 000 | 00690pam a2200217a 44500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20220620145416.0 | ||
| 008 | 160408b2004 xxu||||| |||| 00| 0 eng d | ||
| 020 | _a3540403442 | ||
| 040 | _cIITK | ||
| 041 | _aeng | ||
| 082 |
_a001.64 _bL497 |
||
| 100 | _aDietzfelbinger, Martin | ||
| 245 | 1 |
_aLECTURE NOTES IN COMPUTER SCIENCE (V.3000) _bPRIMALITY TESTING IN POLYNOMIAL TIME : From randomized algorithms to "PRIMES is in P" _cMartin Dietzfelbinger |
|
| 260 |
_bSpringer-Verlag _c2004 _aBerlin |
||
| 300 | _ax, 147p | ||
| 490 | _aLecture Notes in computer science. | ||
| 650 | _aComputer Science | ||
| 856 | _uhttp://link.springer.com/bookseries/558 | ||
| 942 | _cBK | ||
| 999 |
_c351045 _d351045 |
||