A basis for theoretical computer science

✍ Scribed by M.A. Arbib, A.J. Kfoury, R.N. Moll

Publisher: Springer
Year: 1981
Tongue: English
Leaves: 114
Series: Texts and Monographs in Computer Science
Edition: 1
Category: Library

⬇ Acquire This Volume

No coin nor oath required. For personal study only.

✦ Subjects

Дискретная математика

📜 SIMILAR VOLUMES

A Basis for Theoretical Computer Science

📁 A Basis for Theoretical Computer Science

✍ Michael A. Arbib, A. J. Kfoury, Robert N. Moll 📂 Library 📅 1981 🏛 Springer 🌐 English

Computer science seeks to provide a scientific basis for the study of inform a tion processing, the solution of problems by algorithms, and the design and programming of computers. The last forty years have seen increasing sophistication in the science, in the microelectronics which has made mac

A basis for theoretical computer science

📁 A basis for theoretical computer science

✍ Kfoury, A. J.; Arbib, Michael A.; Moll, Robert N 📂 Library 📅 1981 🏛 Springer New York 🌐 English

Computer science seeks to provide a scientific basis for the study of inform a tion processing, the solution of problems by algorithms, and the design and programming of computers. The last forty years have seen increasing sophistication in the science, in the microelectronics which has made machin

Theoretical Computer Science for the Wor

📁 Theoretical Computer Science for the Working Category Theorist

✍ Noson S. Yanofsky 📂 Library 📅 2022 🏛 Cambridge University Press 🌐 English

Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer sc

Theoretical computer science: introducti

📁 Theoretical computer science: introduction to Automata, compurability, complexity, algorithmics, randomization, communication, and cryptography

✍ Juraj Hromkovic 📂 Library 📅 2004 🏛 Springer 🌐 English

Theoretical Computer Science

📁 Theoretical Computer Science

✍ R. E. Mille (auth.), F. Preparata (eds.) 📂 Library 📅 2011 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

R.E. Miller: Parallel program schemata.- D.E. Muller: Theory of automata.- R. Karp: Computational complexity of combinatorial and graph-theoretic problems.

Theoretical Computer Science

📁 Theoretical Computer Science

✍ R. E. Mille (auth.), F. Preparata (eds.) 📂 Library 📅 2011 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

R.E. Miller: Parallel program schemata.- D.E. Muller: Theory of automata.- R. Karp: Computational complexity of combinatorial and graph-theoretic problems.