Pages that link to "Item:Q1078247"
From MaRDI portal
The following pages link to Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time (Q1078247):
Displayed 27 items.
- Bounds on the number of connected components for tropical prevarieties (Q517460) (← links)
- A deterministic polynomial-time algorithm for the first Bertini theorem. III (Q748510) (← links)
- Porous invariants (Q832262) (← links)
- Algorithms for near solutions to polynomial equations (Q840709) (← links)
- Algorithms for sentences over integral domains (Q920964) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV. (Q1037007) (← links)
- Complexity of computations in Commutative Division of the USSR Academy of Sciences (Q1173942) (← links)
- Sentences over integral domains and their computational complexities (Q1286369) (← links)
- Generalized resultants over unirational algebraic varieties (Q1569828) (← links)
- Approximate solutions of polynomial equations. (Q1599546) (← links)
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I (Q1661547) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- On factoring parametric multivariate polynomials (Q1958945) (← links)
- The complexity of local dimensions for constructible sets (Q1977150) (← links)
- Complexity of deciding whether a tropical linear prevariety is a tropical variety (Q2032307) (← links)
- Efficiently and effectively recognizing toricity of steady state varieties (Q2035620) (← links)
- Computation of étale cohomology on curves in single exponential time (Q2211019) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II (Q2307966) (← links)
- Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
- A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals (Q3598000) (← links)
- Factorization of ℤ$$ \mathbb {Z}$$-Homogeneous Polynomials in the First q-Weyl Algebra (Q4556586) (← links)
- Decidable fragments of field theories (Q5202171) (← links)
- Extension of the Newton–Puiseux algorithm to the case of a nonzero characteristic ground field. I (Q5369340) (← links)
- On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004) (← links)
- The isomorphism problem of projective schemes and related algorithmic problems (Q6116696) (← links)