Algorithms and Computation in Mathematics
Completeness and Reduction in Algebraic Complexity Theory
Peter Bürgisser
Mathematics / Numerical Analysis
Bürgisser, a top expert on algebraic complexity theory, has written a monograph on current research in this field. This book gives new results in the theory of NP-completeness. It is written for mathematicians and computer scientists on both research and graduate level.
| Publication Date: |
21 June 2000 |
| Publisher: |
Springer Berlin Heidelberg |
| Imprint: |
Springer |
| ISBN-13: |
9783540667520 |
| Format: |
Hardback |
| Page Count: |
168 |