Randomized polynomial time identity testing for noncommutative circuits

DOI10.1145/3055399.3055442zbMath1369.68347arXiv1606.00596OpenAlexW2963334575MaRDI QIDQ4978027

No author found.

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

randomized algorithmalgebraic complexitypolynomial identity testingnoncommutative computation

Mathematics Subject Classification ID

Related Items (5)

Witnessing matrix identities and proof complexity ⋮ Efficient Black-Box Identity Testing for Free Group Algebras ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees

This page was built for publication: Randomized polynomial time identity testing for noncommutative circuits