𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of number-theoretic constants

✍ Scribed by Eric Bach

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
637 KB
Volume
62
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complexity of decision-theoretic trouble
Complexity of decision-theoretic troubleshooting
✍ Marta VomlelovΓ‘ πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 141 KB

The goal of troubleshooting is to find an optimal solution strategy consisting of actions and observations for repairing a device. We assume a probabilistic model of dependence between possible faults, actions, and observations; the goal is to minimize the expected cost of repair (ECR). We show that

Language-theoretic complexity of disjunc
Language-theoretic complexity of disjunctive sequences
✍ Cristian Calude; Yu Sheng πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 438 KB

A sequence over an alphabet Z is called disjunctirr if it contains all possible finite strings over .Z as its substrings. Disjunctive sequences have been recently studied in various contexts. They abound in both category and measure senses. In this paper we measure the complexity of a sequence x by

The Combinatorics behind Number-Theoreti
The Combinatorics behind Number-Theoretic Sieves
✍ Timothy Y. Chow πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 264 KB

Ever since Viggo Brun's pioneering work, number theorists have developed increasingly sophisticated refinements of the sieve of Eratosthenes to attack problems such as the twin prime conjecture and Goldbach's conjecture. Ever since Gian-Carlo Rota's pioneering work, combinatorialists have found more