๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Computational Complexity of Algebraic and Numeric Problems

โœ Scribed by Borodin, Allan; Munro, Ian


Publisher
UMI Books on Demand;Elsevier Science Ltd
Year
1975
Tongue
English
Leaves
193
Series
Elsevier computer science library : Theory of computation series ; 1
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Subjects


Computational complexity


๐Ÿ“œ SIMILAR VOLUMES


Algebraic computability and enumeration
โœ Nourani, Cyrus F ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› Apple Academic Press;CRC ๐ŸŒ English

"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

Algebraic computability and enumeration
โœ Nourani, Cyrus F. ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› Apple Academic Press ๐ŸŒ English

"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

Algebraic computability and enumeration
โœ Nourani, Cyrus F ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› Apple Academic Press ๐ŸŒ English

"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