Efficient Black-Box Identity Testing for Free Group Algebras
From MaRDI portal
Cites work
- A probabilistic remark on algebraic program testing
- Arithmetic complexity in ring extensions
- Constructive non-commutative rank computation is in deterministic polynomial time
- Deterministic polynomial identity testing in non-commutative models
- Efficient Black-Box Identity Testing for Free Group Algebras
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3721092 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- Minimal Identities for Algebras
- New results on noncommutative and commutative polynomial identity testing
- Non-commutative arithmetic circuits with division
- Polynomial degree bounds for matrix semi-invariants
- Randomized polynomial time identity testing for noncommutative circuits
- Randomness efficient identity testing of multivariate polynomials
- Rational relations and rational identities in division rings. I
- Right ideals generated by an idempotent of finite rank.
- The ideal membership problem and polynomial identity testing
Cited in
(2)
This page was built for publication: Efficient Black-Box Identity Testing for Free Group Algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875516)
