Pages that link to "Item:Q1006651"
From MaRDI portal
The following pages link to Thirty years of polynomial system solving, and now? (Q1006651):
Displayed 9 items.
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Computation of moderate-degree fully-symmetric cubature rules on the triangle using symmetric polynomials and algebraic solving (Q2006047) (← links)
- \( \mathcal{H}_\infty\) consensus for nonlinear stochastic multi-agent systems with time delay (Q2279231) (← links)
- A symbolic algorithm to compute immersions of polynomial systems into linear ones up to an output injection (Q2284963) (← links)
- Parallel computation of real solving bivariate polynomial systems by zero-matching method (Q2451343) (← links)
- The Approach of Moments for Polynomial Equations (Q2802518) (← links)
- On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography (Q2866111) (← links)
- On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2 (Q5406682) (← links)
- Counting solutions of a polynomial system locally and exactly (Q6170809) (← links)