Pages that link to "Item:Q407596"
From MaRDI portal
The following pages link to A local decision test for sparse polynomials (Q407596):
Displaying 7 items.
- Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810) (← links)
- Local tests for consistency of support hyperplane data. (Q960495) (← links)
- On some approximation problems concerning sparse polynomials over finite fields (Q1351508) (← links)
- Multiparty cardinality testing for threshold private intersection (Q2061947) (← links)
- Multi-party threshold private set intersection with sublinear communication (Q2061962) (← links)
- Binomiality testing and computing sparse polynomials via witness sets (Q2155632) (← links)
- Randomness efficient testing of sparse black box identities of unbounded degree over the reals (Q3113719) (← links)