Pages that link to "Item:Q413410"
From MaRDI portal
The following pages link to Characteristic set algorithms for equation solving in finite fields (Q413410):
Displayed 15 items.
- Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited (Q527403) (← links)
- A note on determine the greatest common subfamily of two NFSRs by Gröbner basis (Q905163) (← links)
- Ritt-Wu characteristic set method for Laurent partial differential polynomial systems (Q1730301) (← links)
- Speeding up the GVW algorithm via a substituting method (Q1730310) (← links)
- Elimination theory in differential and difference algebra (Q1730314) (← links)
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition (Q2109980) (← links)
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems (Q2121215) (← links)
- Chordal graphs in triangular decomposition in top-down style (Q2200301) (← links)
- On the efficiency of solving Boolean polynomial systems with the characteristic set method (Q2211189) (← links)
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity (Q2400459) (← links)
- Parametric equation solving and quantifier elimination in finite fields with the characteristic set method (Q2439880) (← links)
- Analyzing Boolean functions via solving parametric polynomial systems (Q2661917) (← links)
- A New Method for Solving Polynomial Systems with Noise over $\mathbb{F}_2$ and Its Applications in Cold Boot Key Recovery (Q3455484) (← links)
- Characteristic sets verses generalized characteristic sets (Q5035097) (← links)
- Computing Switching Surfaces in Optimal Control Based on Triangular Decomposition (Q5175452) (← links)