Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)

By Chaoping Xing and Harald Niederreiter

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.

• Format: Hardcover
• Language: English
• ISBN: 3540667520
• ISBN13: 9783540667520
• Release Date: June 2000
• Publisher: Springer
• Length: 168 Pages
• Weight: 0.96 lbs.
• Dimensions: 0.8" x 6.4" x 9.5"