Computing polynomial representation in subrings of multivariate polynomial rings
From MaRDI portal
Cites work
- A Gröbner free alternative for polynomial system solving
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- Algebraic independence and blackbox identity testing
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
- Computing critical points for algebraic systems defined by hyperoctahedral invariant polynomials
- Computing critical points for invariant algebraic systems
- Computing exact nonlinear reductions of dynamical models
- Computing parametric geometric resolutions
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Connectivity in symmetric semi-algebraic sets
- Cryptanalysis of 2R− Schemes
- Decomposing attacks on asymmetric cryptography based on mapping compositions
- Deformation techniques for efficient polynomial equation solving.
- Evaluation properties of invariant polynomials
- EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS
- Fast multiplication of large numbers
- Fast multiplication of polynomials over fields of characteristic 2
- Fast multivariate power series multiplication in characteristic zero
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Faster real root decision algorithm for symmetric polynomials
- Finite Unitary Reflection Groups
- Greatest common divisors of polynomials given by straight-line programs
- Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Festschrift zu Herrn Ernst Eduard Kummers fünfzigjährigem Doctor-Jubiläum, 10 September 1881)
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- scientific article; zbMATH DE number 3723860 (Why is no real title available?)
- scientific article; zbMATH DE number 503186 (Why is no real title available?)
- scientific article; zbMATH DE number 1057749 (Why is no real title available?)
- scientific article; zbMATH DE number 1107704 (Why is no real title available?)
- scientific article; zbMATH DE number 939812 (Why is no real title available?)
- scientific article; zbMATH DE number 1418302 (Why is no real title available?)
- scientific article; zbMATH DE number 1424120 (Why is no real title available?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Invariants of Finite Groups Generated by Reflections
- Lower bounds for diophantine approximations
- On computing the determinant in small parallel time using a small number of processors
- On fast multiplication of polynomials over arbitrary algebras
- On the complexity of computing Gröbner bases for weighted homogeneous systems
- On the complexity of symmetric polynomials
- Polynomial multiplication over finite fields in time O(n n)
- Scaling invariants and symmetry reduction of dynamical systems
- Schur polynomials do not have small formulas if the determinant does not
- Semi-invariants, equivariants and algorithms
- Solving a system of algebraic equations with symmetries
- Straight-line programs in geometric elimination theory
- The complexity of partial derivatives
- Zeros of equivariant vector fields: Algorithms for an invariant approach
This page was built for publication: Computing polynomial representation in subrings of multivariate polynomial rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288991)
