Completeness and reduction in algebraic complexity theory
By: Burgisser, Peter.
Material type:
BookSeries: Algorithms and computation in mathematics.Publisher: Berlin: Springer, 2010Description: xii, 168 p.; ill.: 24 cm.ISBN: 9783642086045 .Subject(s): Computational complexityDDC classification: 511.352
| Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| Books | 511.352 BUR (Browse shelf) | Available | 026784 |
Browsing DAIICT Shelves Close shelf browser
| 511.352 ARO Computational complexity : a modern approach | 511.352 BOO Computability and logic | 511.352 BUR Super-recursive algorithms | 511.352 BUR Completeness and reduction in algebraic complexity theory | 511.352 COP Computability : Turing, Godel, Church, and beyond | 511.352 FOR Golden ticket : P, NP, and the search for the impossible | 511.352 GOL Computational complexity : a conceptual perspective |
There are no comments for this item.