𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography

✍ Scribed by Tsaban, Boaz

Book ID
121603292
Publisher
Springer
Year
2013
Tongue
English
Weight
417 KB
Volume
28
Category
Article
ISSN
0933-2790

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Polynomial-Time Computation of the Dimen
Polynomial-Time Computation of the Dimension of Algebraic Varieties in Zero-Characteristic
✍ ALEXANDER L. CHISTOV πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 772 KB

In this paper an algorithm is described for the computation of the dimension of a projective algebraic variety over a zero characteristic ground field. The variety is given as a set of zeros of a family of homogeneous polynomials of the degree less than d in n + 1 variables. The working time of the