𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reducibility and Completeness in Private Computations

✍ Scribed by Kilian, Joe; Kushilevitz, Eyal; Micali, Silvio; Ostrovsky, Rafail

Book ID
118177519
Publisher
Society for Industrial and Applied Mathematics
Year
2000
Tongue
English
Weight
410 KB
Volume
29
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Reducibility and Completeness for Sets o
Reducibility and Completeness for Sets of Integers
✍ Richard M. Friedberg; Hartley Rogers jr. πŸ“‚ Article πŸ“… 1959 πŸ› John Wiley and Sons 🌐 English βš– 574 KB

The study of recursively invariant properties of sets of integers was initiated, in large part, in the 1944paper of POST [l]. Various notions of reducibility, redefined below, are introduced in that paper ; and a set is called complete with respect to a given reducibility if (i) it is recursively en

Randomness in Private Computations
Randomness in Private Computations
✍ Kushilevitz, Eyal; Mansour, Yishay πŸ“‚ Article πŸ“… 1997 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 297 KB
Computing Galois Groups of Completely Re
Computing Galois Groups of Completely Reducible Differential Equations
✍ Elie Compoint; Michael F Singer πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 449 KB

We give an algorithm to calculate a presentation of the Picard-Vessiot extension associated to a completely reducible linear differential equation (i.e. an equation whose Galois group is reductive). Using this, we show how to compute the Galois group of such an equation as well as properties of the