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

๐Ÿ“

Computational Category Theory (Prentice-Hall International Series in Computer Science)

โœ Scribed by D. E. Rydeheard, Burstall


Publisher
Prentice Hall
Year
1988
Tongue
English
Leaves
263
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Introduction to the Theory of Complexity
โœ Daniel P. Bovet, Pierluigi Crescenzi ๐Ÿ“‚ Library ๐Ÿ“… 1994 ๐Ÿ› Prentice Hall PTR ๐ŸŒ English

Reviewing in a systematic way the most significant results obtained in the study of computational complexity, this book follows a balanced approach which is partly algorithmic and partly structuralist, assuming a basic knowledge of computational theory, elementary logic and programming techniques. F

Parallel Numerical Algorithms (Prentice-
โœ T. L. Freeman, C. Phillips ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐ŸŒ English

With the increasing use of more powerful multiprocessor computer systems comes the need to develop parallel implementations of numerical methods which were originally developed for use with uniprocessors. Focusing on shared and local memory MIMD parallel computer systems, this volume is designed to