scientific article; zbMATH DE number 3999284

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

determinant parallel processing linear algebra parallel computations algebraic computing systems of linear equations arithmetic circuit complexity classes division with remainder models of computation rank of matrices polynomial arithmetic large finite fields large powers zero-tests

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25)

Related Items

Oracle computations in parallel numerical linear algebra, Algorithmic aspects of Suslin's proof of Serre's conjecture, Factoring polynomials and primitive elements for special primes, On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations, Inversion in finite fields using logarithmic depth, Boolean circuits versus arithmetic circuits, Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, Computing generators of the ideal of a smooth affine algebraic variety, Nearly sharp complexity bounds for multiprocessor algebraic computations, Lower bounds for arithmetic networks. II: Sum of Betti numbers, Feasible arithmetic computations: Valiant's hypothesis, Polynomial equation solving by lifting procedures for ramified fibers, Matrix structures in parallel matrix computations, Straight-line programs in geometric elimination theory, On a generalization of Stickelberger's theorem, Topological lower bounds for arithmetic networks, Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations, Parallel models of computation: An introductory survey, Effective Łojasiewicz inequalities in semialgebraic geometry, Matrix inversion in RNC\(^ 1\), The membership problem for unmixed polynomial ideals is solvable in single exponential time, Computing multihomogeneous resultants using straight-line programs, Deformation techniques for efficient polynomial equation solving., Highly parallel computations modulo a number having only small prime factors, Parallel restructuring and evaluation of expressions, Parallel information-based complexity, Parallel algebraic reductions among numerical problems, \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\), NC algorithms for real algebraic numbers, Two \(P\)-complete problems in the theory of the reals, Parametrization of Newton's iteration for computations with structured matrices and applications, A Gröbner free alternative for polynomial system solving, On sign conditions over real multivariate polynomials, A parametric representation of totally mixed Nash equilibria, Computing bases of complete intersection rings in Noether position, Zero counting for a class of univariate Pfaffian functions, Lower bounds for arithmetic networks, Sur la complexité du principe de Tarski-Seidenberg, Planar acyclic computation, Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields, Functional decomposition of polynomials: the tame case, On the parallel complexity of the polynomial ideal membership problem, Deformation techniques for sparse systems, Complexity bounds in elimination theory -- a survey., On the complexity of counting components of algebraic varieties, Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, Fast computation of a rational point of a variety over a finite field, The Projective Noether Maple Package: Computing the dimension of a projective variety, Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity, Description of the connected components of a semialgebraic set in single exponential time