𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Complexity and Computation

✍ Scribed by Allen B. Downey

Publisher
Green Tea Press
Year
2011
Tongue
English
Leaves
104
Edition
online ed. (version 1.0.1, 104p., Fall 2011)
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Randomness and Completeness in Computati
πŸ“ Randomness and Completeness in Computational Complexity
✍ Dieter van Melkebeek (auth.) πŸ“‚ Library πŸ“… 2000 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1

Randomness and Completeness in Computati
πŸ“ Randomness and Completeness in Computational Complexity
✍ Dieter van Melkebeek (auth.) πŸ“‚ Library πŸ“… 2000 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1

Communication Complexity and Parallel Co
πŸ“ Communication Complexity and Parallel Computing
✍ Juraj Hromkovič πŸ“‚ Library πŸ“… 1997 πŸ› Springer 🌐 English

This book is devoted to the investigation of a special topic in theoretical computer science - communication complexity as an abstract measure of the complexity of computing problems. Its main aim is to show how the theoretical study of communication complexity can be useful in the process of design

Communication Complexity and Parallel Co
πŸ“ Communication Complexity and Parallel Computing
✍ Juraj Hromkovič πŸ“‚ Library πŸ“… 1997 πŸ› Springer 🌐 English

<p>The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamenΒ­ tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication c

Cancer, Complexity, Computation (Emergen
πŸ“ Cancer, Complexity, Computation (Emergence, Complexity and Computation, 46)
✍ Igor Balaz (editor), Andrew Adamatzky (editor) πŸ“‚ Library πŸ“… 2022 πŸ› Springer 🌐 English

<p><span>This book presents unique compendium of groundbreaking ideas where scientists from many different backgrounds are united in their interest in interdisciplinary approaches towards origins and development of cancers, innovative ways of searching for cancer treatment and the role of cancer in