Pages that link to "Item:Q5897760"
From MaRDI portal
The following pages link to FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897760):
Displayed 35 items.
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- A Wronskian approach to the real \(\tau\)-conjecture (Q480686) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- Linear matroid intersection is in quasi-NC (Q2027206) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
- Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← 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)
- On the Arithmetic Complexity of Euler Function (Q3007615) (← links)
- Recent Results on Polynomial Identity Testing (Q3007643) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- Algebraic Independence and Blackbox Identity Testing (Q3012915) (← links)
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size (Q3541802) (← links)
- (Q4612482) (← links)
- (Q5002729) (← links)
- (Q5028363) (← links)
- Derandomization from Algebraic Hardness (Q5073523) (← links)
- (Q5090938) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- A generalized sylvester-gallai type theorem for quadratic polynomials (Q5092455) (← links)
- Sylvester-Gallai type theorems for quadratic polynomials (Q5126776) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Depth-4 Identity Testing and Noether’s Normalization Lemma (Q5740194) (← links)
- (Q6084351) (← links)
- Testing the satisfiability of algebraic formulas over the field of two elements (Q6137613) (← links)