scientific article; zbMATH DE number 1142301
From MaRDI portal
Publication:4385517
zbMath0900.68247MaRDI QIDQ4385517
Publication date: 4 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items
Randomized heuristics for exploiting Jacobian scarcity, Tensors in computations, Parity OBDDs cannot be handled efficiently enough, Polynomial equation solving by lifting procedures for ramified fibers, Deformation techniques to solve generalised Pham systems, Easy lower bound for a strange computational model, Tensor rank: matching polynomials and Schur rings, Numerical stability and tensor nuclear norm, Efficient evaluation of specific queries in constraint databases, On arithmetic branching programs, Time-space tradeoffs in algebraic complexity theory, A theory of even functionals and their algorithmic applications, Test complexity of generic polynomials, Evaluating geometric queries using few arithmetic operations, A new method to obtain lower bounds for polynomial evaluation, Lower bounds for arithmetic networks, The border rank of the multiplication of $2\times 2$ matrices is seven, Using fast matrix multiplication to find basic solutions, Deformation techniques for sparse systems, Semisimple algebras of almost minimal rank over the reals, Decidability and modules over Bézout domains, Fast computation of a rational point of a variety over a finite field, Exact Image Reconstruction from a Single Projection through Real Computation, Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
