Testing equivalence to design polynomials
From MaRDI portal
Cites work
- A fast isomorphism test for groups whose Lie algebra has genus 2
- A probabilistic remark on algebraic program testing
- Affine projections of polynomials (extended abstract)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
- Colored hypergraph isomorphism is fixed parameter tractable
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Decomposing \(p\)-groups via Jordan algebras.
- Determinant Equivalence Test over Finite Fields and over Q
- Efficient algorithms for some special cases of the polynomial equivalence problem
- Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms
- Equivalence test for read-once arithmetic formulas
- Factoring polynomials with rational coefficients
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Graph isomorphism in quasipolynomial time (extended abstract)
- Graph isomorphism, general remarks
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Hitting sets and reconstruction for dense orbits in VPe and ΣΠΣ circuits
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1253966 (Why is no real title available?)
- scientific article; zbMATH DE number 1332670 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 7559443 (Why is no real title available?)
- Learning generalized depth three arithmetic circuits in the non-degenerate case
- Learning sums of powers of low-degree polynomials in the non-degenerate case
- On hardness of testing equivalence to sparse polynomials under shifts
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- On the Symmetries of and Equivalence Test for Design Polynomials.
- Reconstruction of full rank algebraic branching programs
- Reconstruction of non-degenerate homogeneous depth three circuits
- STACS 2005
- Testing equivalence to design polynomials
- Testing polynomial equivalence by scaling matrices
Cited in
(2)
This page was built for publication: Testing equivalence to design polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902717)
