Pages that link to "Item:Q5254013"
From MaRDI portal
The following pages link to Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013):
Displayed 18 items.
- On the power of algebraic branching programs of width two (Q260398) (← links)
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Lower bounds for matrix factorization (Q2041242) (← 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)
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
- (Q4612482) (← links)
- (Q5002729) (← links)
- (Q5028363) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- (Q5090938) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- Improved Explicit Hitting-Sets for ROABPs (Q6084347) (← links)
- A deterministic parallel reduction from weighted matroid intersection search to decision (Q6130320) (← links)