Computational Complexity of Algebraic and Numeric Problems
โ Scribed by Allan Borodin, Ian Munro
- Publisher
- Elsevier Science Ltd
- Year
- 1975
- Tongue
- English
- Leaves
- 193
- Series
- Elsevier computer science library : Theory of computation series ; 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Subjects
Linear Programming;Applied;Mathematics;Science & Math
๐ SIMILAR VOLUMES
"This book, Computability, Algebraic Trees, Enumeration Degree Models, and Applications, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic view point. The reader is first introduced to categories and functorial m
"This book, Computability, Algebraic Trees, Enumeration Degree Models, and Applications, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic view point. The reader is first introduced to categories and functorial m
"This book, Computability, Algebraic Trees, Enumeration Degree Models, and Applications, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic view point. The reader is first introduced to categories and functorial m