A note on probabilistically verifying integer and polynomial products
From MaRDI portal
Publication:3477964
DOI10.1145/58562.214082zbMath0699.68068OpenAlexW1985008110MaRDI QIDQ3477964
Publication date: 1989
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/58562.214082
Related Items (3)
A survey on delegated computation ⋮ Polynomial modular product verification and its implications ⋮ Self-testing/correcting with applications to numerical problems
This page was built for publication: A note on probabilistically verifying integer and polynomial products
