𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computability of the additive complexity of algebraic circuits with root extracting

✍ Scribed by Dima Grigoriev; Marek Karpinski

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
643 KB
Volume
157
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computing in the Field of Complex Algebr
Computing in the Field of Complex Algebraic Numbers
✍ ADAM WOJCIECH STRZEBOΕƒSKI πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 371 KB

In this paper we present two methods of computing with complex algebraic numbers. The first uses isolating rectangles to distinguish between the roots of the minimal polynomial, the second method uses validated numeric approximations. We present algorithms for arithmetic and for solving polynomial e

The Computational Complexity of Some Pro
The Computational Complexity of Some Problems of Linear Algebra
✍ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=