The following pages link to (Q4725742):
Displaying 50 items.
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- On a generalization of Stickelberger's theorem (Q607067) (← links)
- Planar acyclic computation (Q751805) (← links)
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (Q752692) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- On the complexity of counting components of algebraic varieties (Q1030247) (← links)
- Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Matrix structures in parallel matrix computations (Q1122309) (← links)
- Effective Łojasiewicz inequalities in semialgebraic geometry (Q1177863) (← links)
- Matrix inversion in RNC\(^ 1\) (Q1179457) (← links)
- The membership problem for unmixed polynomial ideals is solvable in single exponential time (Q1180154) (← links)
- Highly parallel computations modulo a number having only small prime factors (Q1184734) (← links)
- Parallel restructuring and evaluation of expressions (Q1185242) (← links)
- Parallel information-based complexity (Q1186504) (← links)
- Parallel algebraic reductions among numerical problems (Q1190636) (← links)
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) (Q1201156) (← links)
- NC algorithms for real algebraic numbers (Q1201334) (← links)
- Two \(P\)-complete problems in the theory of the reals (Q1203649) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Description of the connected components of a semialgebraic set in single exponential time (Q1317872) (← links)
- Oracle computations in parallel numerical linear algebra (Q1325837) (← links)
- Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Complexity bounds in elimination theory -- a survey. (Q1565824) (← links)
- The Projective Noether Maple Package: Computing the dimension of a projective variety (Q1587230) (← links)
- Lower bounds for arithmetic networks (Q1803554) (← links)
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros (Q1824354) (← links)
- Lower bounds for arithmetic networks. II: Sum of Betti numbers (Q1908901) (← links)
- Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties (Q1928235) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- Algorithmic aspects of Suslin's proof of Serre's conjecture (Q2366722) (← links)
- On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations (Q2379679) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Topological lower bounds for arithmetic networks (Q2410689) (← links)
- Computing multihomogeneous resultants using straight-line programs (Q2457419) (← links)
- Inversion in finite fields using logarithmic depth (Q2638778) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- Computing generators of the ideal of a smooth affine algebraic variety (Q2643543) (← links)
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations (Q3520053) (← links)
- Sur la complexité du principe de Tarski-Seidenberg (Q4713865) (← links)
