Efficient Black-Box Identity Testing for Free Group Algebras

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.57OpenAlexW2963709672MaRDI QIDQ5875516

Partha Mukhopadhyay, V. Arvind, Abhranil Chatterjee, Rajit Datta

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1904.12337

zbMATH Keywords

randomized algorithmsfree group algebranoncommutative computationrational identity testing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Efficient Black-Box Identity Testing for Free Group Algebras ⋮ A Special Case of Rational Identity Testing and the Brešar-Klep Theorem.

Cites Work

• Polynomial degree bounds for matrix semi-invariants
• New results on noncommutative and commutative polynomial identity testing
• Right ideals generated by an idempotent of finite rank.
• The ideal membership problem and polynomial identity testing
• Rational relations and rational identities in division rings. I
• A probabilistic remark on algebraic program testing
• Constructive non-commutative rank computation is in deterministic polynomial time
• Deterministic polynomial identity testing in non-commutative models
• Non-commutative arithmetic circuits with division
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Randomized polynomial time identity testing for noncommutative circuits
• Randomness efficient identity testing of multivariate polynomials
• Minimal Identities for Algebras
• Efficient Black-Box Identity Testing for Free Group Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Black-Box Identity Testing for Free Group Algebras