𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some complexity theory for cryptography

✍ Scribed by A.M. Gaglione

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
94 KB
Volume
7
Category
Article
ISSN
0167-4048

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FO
SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES
✍ Gregory L. McColm πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 367 KB

## Abstract It is known that for two given countable sets of unary relations __A__ and __B__ on Ο‰ there exists an infinite set __H__ β«… Ο‰ on which __A__ and __B__ are the same. This result can be used to generate counterexamples in expressibility theory. We examine the sharpness of this result.

Complexity Theory for Lie-Group Solvers
Complexity Theory for Lie-Group Solvers
✍ Elena Celledoni; Arieh Iserles; Syvert P. NΓΈrsett; Bojan Orel πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 300 KB
Some Complexity Results for Polynomial I
Some Complexity Results for Polynomial Ideals
✍ Ernst W. Mayr πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 184 KB

In this paper, we survey some of our new results on the complexity of a number of problems related to polynomial ideals. We consider multivariate polynomials over some ring, like the integers or the rationals. For instance, a polynomial ideal membership problem is a (w + 1)-tuple P = ( f, g 1 , g 2