Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
Edition: 1 edition
Publisher: Springer
Published: July 26, 2000
Language: eng
Format: Hardcover
Number of pages: 168
ISBN-13: 9783540667520
Subjects: Applied mathematics; Mathematical logic; Mathematical theory of computation; Mathematics; Computer Mathematics; Systems Analysis; Science/Mathematics; Discrete Mathematics; Logic; Mathematics / Number Systems; Advanced; Computer Science; Computational complexity
First sentence: Computational complexity theory provides a framework for understanding the cost required to solve algorithmic problems.