Pages that link to "Item:Q1016493"
From MaRDI portal
The following pages link to Counting solutions of polynomial systems via iterated fibrations (Q1016493):
Displaying 12 items.
- Algorithmic Thomas decomposition of algebraic and differential systems (Q432753) (← links)
- An \(L_2\)-quotient algorithm for finitely presented groups. (Q731255) (← links)
- Singularities of algebraic differential equations (Q820936) (← links)
- Counting solutions to binomial complete intersections (Q870342) (← links)
- A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots (Q1186712) (← links)
- Defining the \(q\)-analogue of a matroid (Q1658766) (← links)
- The differential counting polynomial (Q1750382) (← links)
- Algebraically simple involutive differential systems and the Cauchy problem (Q2452931) (← links)
- Counting affine roots of polynomial systems via pointed Newton polytopes (Q2565193) (← links)
- S-iteration scheme and polynomiography (Q3455293) (← links)
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties (Q5018379) (← links)
- Thomas Decomposition and Nonlinear Control Systems (Q5118404) (← links)
