Pages that link to "Item:Q901932"
From MaRDI portal
The following pages link to Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932):
Displaying 12 items.
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Sums of read-once formulas: how many summands are necessary? (Q1686070) (← links)
- Black-box identity testing of depth-4 multilinear circuits (Q1715077) (← links)
- A polynomial-time dependence test for determining integer-valued solutions in multi-dimensional arrays under variable bounds (Q1777451) (← links)
- A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← links)
- Monomials, multilinearity and identity testing in simple read-restricted circuits (Q2637354) (← links)
- Characterizing arithmetic read-once formulae (Q2828215) (← links)
- Deterministic identity testing of depth-\(4\) multilinear circuits with bounded top fan-in (Q2875192) (← links)
- Recent Results on Polynomial Identity Testing (Q3007643) (← links)
- Algebraic Independence and Blackbox Identity Testing (Q3012915) (← links)
- Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing (Q4910477) (← links)
- Sums of Read-Once Formulas: How Many Summands Suffice? (Q5740191) (← links)