Pages that link to "Item:Q3962460"
From MaRDI portal
The following pages link to Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs (Q3962460):
Displaying 22 items.
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant (Q315740) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Straight-line instruction sequence completeness for total calculation on cancellation meadows (Q538468) (← links)
- The complexity of equivalence for commutative rings (Q758209) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Probabilistic algorithms and straight-line programs for some rank decision problems (Q1155356) (← links)
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields (Q1178687) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- Emptiness problems for integer circuits (Q2182324) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- An arithmetic Poisson formula for the multi-variate resultant (Q2441516) (← links)
- (Q2741527) (← links)
- Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- Evaluating Matrix Circuits (Q3196387) (← links)
- Emptiness Problems for Integer Circuits (Q5111247) (← links)
