Image from Amazon.com
Completeness & reduction in algebraic complexity theory P. Burgisser
Material type:
TextSeries: Algorithms & computation in mathematics 7Publication details: Berlin Springer 2000 Description: xii 168ISBN: 9783540667520Subject(s): Algebraic Complexity TheoryDDC classification: 2.09
| Item type | Current library | Collection | Call number | Materials specified | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| Books | TIFR CAM Library | CML | 2.09 BURG (Browse shelf(Opens below)) | Available | M8254 |
Browsing TIFR CAM Library shelves, Collection: CML Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 2.08 LOVA Discrete mathematics elementary & beyond | 2.08 SACH Combinatorial methods in discrete mathematics | 2.08 TUTT Graph theory | 2.09 BURG Completeness & reduction in algebraic complexity theory | 2+4+10 DESO Berkeley problems in mathematics | 3.01+18 BUEL Computational perspectives on number theory proceedings of a conference in honor of A.O.L atkin | 3.01+2.08 DAVI Elementary number theory, group theory & ramanujan graphs |
There are no comments on this title.