Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

Cited in

(26)

Feasible arithmetic computations: Valiant's hypothesis
Probabilistic algorithms and straight-line programs for some rank decision problems
On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
Straight-line programs in geometric elimination theory
Knapsack in graph groups
Evaluation of circuits over nilpotent and polycyclic groups
On the complexity of pattern matching for highly compressed two-dimensional texts.
Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing
Compression techniques in group theory
Emptiness problems for integer circuits
An arithmetic Poisson formula for the multi-variate resultant
Complexity and approximability of quantified and stochastic constraint satisfaction problems
Geometric complexity theory. V: Efficient algorithms for Noether normalization
Parallel identity testing for skew circuits with big powers and applications
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
Evaluating matrix circuits
Classifying the computational complexity of problems
On enumerating monomials and other combinatorial structures by polynomial interpolation
Parallel identity testing for skew circuits with big powers and applications
Emptiness problems for integer circuits
Straight-line instruction sequence completeness for total calculation on cancellation meadows
Kronecker's and Newton's approaches to solving: a first comparison
On the complexity of commutativity analysis
Randomized black-box pit for small depth +-regular non-commutative circuits
The complexity of equivalence for commutative rings

This page was built for publication: Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962460)