Abstract
We show that each randomized o(|G|2)-query algorithm can recover only an expected o(1) fraction of the Cayley table of some finite Abelian loop (G,⋅), where both multiplication and inversion queries are allowed. Furthermore, each randomized o(|R|2)-query algorithm can recover only an expected o(1) fraction of any of the Cayley tables of some finite commutative semiring (R,+,⋅), with (R,+) being a commutative aperiodic monoid, where each query may ask for x+y or x⋅y for any x, y∈R.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
