Pages that link to "Item:Q1311615"
From MaRDI portal
The following pages link to On decomposing systems of polynomial equations with finitely many solutions (Q1311615):
Displaying 16 items.
- Classifying partial Latin rectangles (Q324368) (← links)
- Characteristic set algorithms for equation solving in finite fields (Q413410) (← links)
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers (Q611072) (← links)
- Determining the global minimum of Higgs potentials via Groebner bases - applied to the NMSSM (Q982780) (← links)
- Gröbner bases and cocyclic Hadamard matrices (Q1635271) (← links)
- Triangular sets for solving polynomial systems: a comparative implementation of four methods (Q1808665) (← links)
- Recurrence equations and their classical orthogonal polynomial solutions (Q1855677) (← links)
- On the efficiency of solving Boolean polynomial systems with the characteristic set method (Q2211189) (← links)
- Counting and enumerating feasible rotating schedules by means of Gröbner bases (Q2228806) (← links)
- A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares (Q2326748) (← links)
- A factorization algorithm for \(G\)-algebras and its applications (Q2409016) (← links)
- A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields (Q2831035) (← links)
- Solving via Modular Methods (Q3455092) (← links)
- THE NEXT-TO-MINIMAL SUPERSYMMETRIC EXTENSION OF THE STANDARD MODEL REVIEWED (Q3590693) (← links)
- A primer on ideal theoretical operation in non-commutative polynomial rings (Q5498574) (← links)
- A solution to the global identification problem in DSGE models (Q6054393) (← links)