|
|
|
|
| LEADER |
00769nam a2200193 a 4500 |
| 001 |
1326175 |
| 005 |
20171111233255.0 |
| 008 |
081217s2000 gr erb 001 0 eng d |
| 020 |
|
|
|a 3540667520
|q (acid-free paper)
|
| 040 |
|
|
|a GrAtEKP.pliroforiki
|b gre
|e AACR2
|
| 082 |
|
0 |
|2 21
|a 511.3
|
| 100 |
1 |
|
|a Burgisser, Peter,
|d 1962-
|
| 245 |
1 |
0 |
|a Completeness and reduction in algebraic complexity theory/
|c Peter Burgisser
|
| 260 |
|
|
|a Berlin
|b Springer,
|c c2000
|a New York:
|
| 300 |
|
|
|a xii, 168 p. :
|b ill. ;
|c 24 cm.
|
| 490 |
0 |
|
|a Algorithms and computation in mathematics,
|v v. 7
|x 1431-1550 ;
|
| 504 |
|
|
|a Includes bibliographical references (p. [149]-157) and index
|
| 650 |
1 |
0 |
|a Computational complexity
|
| 952 |
|
|
|a GrAtEKP
|b 59cd12dc6c5ad134460efb58
|c 998a
|d 945l
|e 511.3 BurP c 2000
|t 1
|x m
|z Books
|
