Pages that link to "Item:Q1209332"

The following pages link to A probabilistic algorithm for verifying matrix products using \(O(n^ 2)\) time and \(\log_ 2n+O(1)\) random bits (Q1209332):

Displaying 10 items.

• Certifying algorithms (Q465678) (← links)
• Bounds on sample space size for matrix product verification (Q1313769) (← links)
• The matrix reproved (verification pearl) (Q1703015) (← links)
• A probabilistic algorithm for verifying polynomial middle product in linear time (Q1799565) (← links)
• Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification (Q2026637) (← links)
• Efficiently correcting matrix products (Q2408920) (← links)
• Efficiently Correcting Matrix Products (Q2942613) (← links)
• Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 (Q4562282) (← links)
• (Q5009621) (← links)
• Error Correction in Fast Matrix Multiplication and Inverse (Q5120215) (← links)