Pages that link to "Item:Q3654372"
From MaRDI portal
The following pages link to Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates (Q3654372):
Displaying 10 items.
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials (Q1686837) (← links)
- A generalized Sylvester–Gallai-type theorem for quadratic polynomials (Q5058240) (← links)
- A generalized sylvester-gallai type theorem for quadratic polynomials (Q5092455) (← links)
- Sylvester-Gallai type theorems for quadratic polynomials (Q5126776) (← links)
- Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond (Q6172035) (← links)
