Pages that link to "Item:Q1078248"
From MaRDI portal
The following pages link to Factorization of polynomials over a finite field and the solution of systems of algebraic equations (Q1078248):
Displaying 11 items.
- Bounds on the number of connected components for tropical prevarieties (Q517460) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Sentences over integral domains and their computational complexities (Q1286369) (← links)
- Generalized resultants over unirational algebraic varieties (Q1569828) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- On factoring parametric multivariate polynomials (Q1958945) (← 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)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
