Pages that link to "Item:Q5175971"
From MaRDI portal
The following pages link to Randomness efficient identity testing of multivariate polynomials (Q5175971):
Displayed 40 items.
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials (Q1686837) (← links)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
- Sparse polynomial interpolation based on diversification (Q2143469) (← links)
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs (Q2188992) (← links)
- Tropical combinatorial Nullstellensatz and sparse polynomials (Q2194772) (← links)
- Computing Walrasian equilibria: fast algorithms and structural properties (Q2288196) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- Characterizing Arithmetic Read-Once Formulae (Q2828215) (← links)
- COMPLEXITY OF SHORT GENERATING FUNCTIONS (Q3119462) (← links)
- Arithmetic Circuits, Monomial Algebras and Finite Automata (Q3182914) (← links)
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size (Q3541802) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- (Q5002654) (← links)
- (Q5002729) (← links)
- (Q5028363) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Depth-4 Identity Testing and Noether’s Normalization Lemma (Q5740194) (← links)
- Efficient Black-Box Identity Testing for Free Group Algebras (Q5875516) (← links)
- (Q6084350) (← links)
- (Q6084351) (← links)
- No short polynomials vanish on bounded rank matrices (Q6096830) (← links)
- Algebraic algorithms for variants of subset sum (Q6102280) (← links)