scientific article; zbMATH DE number 7204372
From MaRDI portal
Publication:5111252
Recommendations
- The complexity of checking identities for finite matrix rings
- New results on noncommutative and commutative polynomial identity testing
- On the factorization of non-commutative polynomials (in free associative algebras)
- Deterministic polynomial identity testing in non-commutative models
- Non-unique factorization of polynomials over residue class rings of the integers
- Factoring in skew-polynomial rings over finite fields
- A faster algorithm for testing polynomial representability of functions over finite integer rings
- Reduction-free multiplication for finite fields and polynomial rings
- On the relation between polynomial identity testing and finding variable disjoint factors
- Equivalence of polynomial identity testing and polynomial factorization
Cites work
- Arithmetic circuits: a survey of recent results and open questions
- Computing Frobenius maps and factoring polynomials
- Deterministic polynomial identity testing in non-commutative models
- Equivalence of polynomial identity testing and polynomial factorization
- Factoring Polynomials Over Large Finite Fields
- Minimal Identities for Algebras
- New results on noncommutative and commutative polynomial identity testing
- Non-commutative circuits and the sum-of-squares problem
- Non-commutative computations: lower bounds and polynomial identity testing
- Noncommutative Unique Factorization Domains
- Some lower bound results for set-multilinear arithmetic computations
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111252)
