Pages that link to "Item:Q1781113"
From MaRDI portal
The following pages link to Deterministic polynomial identity testing in non-commutative models (Q1781113):
Displaying 35 items.
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- On testing monomials in multivariate polynomials (Q391220) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Reconcilable differences (Q639856) (← links)
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- On the complexity of noncommutative polynomial factorization (Q1784944) (← links)
- Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials (Q1944393) (← 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)
- Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- Algorithms for orbit closure separation for invariants and semi-invariants of matrices (Q2219886) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- Recent Results on Polynomial Identity Testing (Q3007643) (← links)
- Arithmetic Circuits, Monomial Algebras and Finite Automata (Q3182914) (← links)
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size (Q3541802) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- Witnessing matrix identities and proof complexity (Q4634922) (← links)
- (Q5028363) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. (Q5089170) (← links)
- (Q5090938) (← links)
- (Q5111252) (← links)
- (Q5111256) (← links)
- (Q5232538) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Efficient Black-Box Identity Testing for Free Group Algebras (Q5875516) (← links)
- On the hardness of the noncommutative determinant (Q5916037) (← links)
- Improved Explicit Hitting-Sets for ROABPs (Q6084347) (← links)