Pages that link to "Item:Q1686835"
From MaRDI portal
The following pages link to Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835):
Displaying 11 items.
- 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)
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
- Deterministic black-box identity testing \(\pi\)-ordered algebraic branching programs (Q2908859) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q4601835) (← links)
- (Q4612482) (← links)
- (Q5028363) (← links)
- (Q5111163) (← links)
- Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs (Q5368905) (← links)
- Improved Explicit Hitting-Sets for ROABPs (Q6084347) (← links)
- (Q6084351) (← links)