Probabilistic checking of associativity in algebras

DOI10.1016/0020-0190(91)90186-LzbMath0715.17001OpenAlexW2050609779WikidataQ127774032 ScholiaQ127774032MaRDI QIDQ752151

D. Kharzeev

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90186-l

zbMATH Keywords

analysis of algorithmsMonte Carlo algorithmsprobabilistic algorithmnonassociative algebramultilinear identity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to nonassociative rings and algebras (17-08) Nonassociative algebras satisfying other identities (17A30)

Cites Work

• Complexity and Unsolvability Properties of Nilpotency
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Exhaustive checking of sparse algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic checking of associativity in algebras