Pages that link to "Item:Q626693"

The following pages link to New results on noncommutative and commutative polynomial identity testing (Q626693):

Displaying 13 items.

• Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
• Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
• Sparse multivariate polynomial interpolation on the basis of Schubert polynomials (Q1686837) (← links)
• On the complexity of noncommutative polynomial factorization (Q1784944) (← links)
• Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
• Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size (Q3541802) (← links)
• Randomized polynomial time identity testing for noncommutative circuits (Q4978027) (← links)
• A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. (Q5089170) (← links)
• (Q5111252) (← links)
• Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
• (Q5232538) (← links)
• Efficient Black-Box Identity Testing for Free Group Algebras (Q5875516) (← links)
• Multivariate to bivariate reduction for noncommutative polynomial factorization (Q6647758) (← links)