The following pages link to (Q4526983):
Displaying 7 items.
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- On testing for zero polynomials by a set of points with bounded precision. (Q1401255) (← links)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- Efficiently correcting matrix products (Q2408920) (← links)
- Efficiently Correcting Matrix Products (Q2942613) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- (Q6084351) (← links)