scientific article; zbMATH DE number 7559443
From MaRDI portal
Publication:5089246
Cites work
- Affine projections of polynomials (extended abstract)
- Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
- Arithmetic circuits: a survey of recent results and open questions
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
- Computing Irreducible Representations of Finite Groups
- Computing the structure of finite algebras
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- 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
- Explicit $n$-descent on elliptic curves III. Algorithms
- Geometric aspects of iterated matrix multiplication
- Geometric complexity theory and matrix powering
- Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
- Geometric complexity theory. I: An approach to the P vs. NP and related problems
- Geometric complexity theory: an introduction for geometers
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- scientific article; zbMATH DE number 1332669 (Why is no real title available?)
- scientific article; zbMATH DE number 1332670 (Why is no real title available?)
- scientific article; zbMATH DE number 3404329 (Why is no real title available?)
- Learning arithmetic circuits via partial derivatives.
- Lower bounds for depth-4 formulas computing iterated matrix multiplication
- Lower bounds on arithmetic circuits via partial derivatives
- On the power of homogeneous depth 4 arithmetic circuits
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree
- Partial derivatives in arithmetic complexity and beyond
- Reconstruction of full rank algebraic branching programs
- Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth-three circuits
- Small-depth multilinear formula lower bounds for iterated matrix multiplication with applications
- Splitting full matrix algebras over algebraic number fields.
- STACS 2005
- The module isomorphism problem reconsidered.
- Wildness for tensors
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089246)
