Verification of Identities

DOI10.1137/S0097539797325387MaRDI QIDQ4943861zbMATH OpenOpenAlexWikidataFDO

Authors Sridhar Rajagopalan, Leonard J. Schulman

Publication date 19 March 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539797325387

zbMATH Keywords

computer aided verificationrandomized algorithms

Mathematics Subject Classification ID

Sets with a single binary operation (groupoids) (20N02) Loops, quasigroups (20N05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Probabilistic checking of associativity in algebras
• scientific article; zbMATH DE number 1775411
• scientific article; zbMATH DE number 1528623
• Checking quasi-identities in a finite semigroup may be computationally hard.
• A probabilistic algorithm for verifying matrix products using \(O(n^ 2)\) time and \(\log_ 2n+O(1)\) random bits

Cited in

(9)

• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
• How traveling salespersons prove their identity
• Improved quantum query algorithms for triangle detection and associativity testing
• scientific article; zbMATH DE number 7310291 (Why is no real title available?)
• Nearly linear time isomorphism algorithms for some nonabelian group classes
• Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
• On testing group properties
• Testing Whether a Table Defines a Group
• Probabilistic checking of associativity in algebras

This page was built for publication: Verification of Identities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943861)