Pages that link to "Item:Q5495802"

The following pages link to Quasi-polynomial hitting-set for set-depth-Δ formulas (Q5495802):

Displaying 16 items.

• Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
• Read-once polynomial identity testing (Q496300) (← links)
• Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
• Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
• Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
• Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
• Improved hitting set for orbit of ROABPs (Q2087774) (← links)
• A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← 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)
• Geometric complexity theory. V: Efficient algorithms for Noether normalization (Q2826783) (← links)
• (Q4601834) (← links)
• Towards blackbox identity testing of log-variate circuits (Q5002729) (← links)
• (Q5090938) (← links)
• Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
• Improved Explicit Hitting-Sets for ROABPs (Q6084347) (← links)