Completeness and Reduction in Algebraic Complexity Theory / by Peter Bürgisser.

The theory of NP-completeness is a cornerstone of computational complexity. This monograph provides a thorough and comprehensive treatment of this concept in the framework of algebraic complexity theory. Many of the results presented are new and published for the first time. Topics include: complete...

Full description

Saved in:
Bibliographic Details
Online Access: Full Text (via Springer)
Main Author: Bürgisser, Peter
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2000.
Series:Algorithms and computation in mathematics ; v. 7.
Subjects:

Internet

Full Text (via Springer)

Online

Holdings details from Online
Call Number: QA71-90
QA71-90 Available