scientific article; zbMATH DE number 7559443
From MaRDI portal
Publication:5089246
DOI10.4230/LIPIcs.MFCS.2020.72MaRDI QIDQ5089246
Chandan Saha, Vineet Nair, Janaky Murthy
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2006.08272
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric aspects of iterated matrix multiplication
- Splitting full matrix algebras over algebraic number fields.
- The module isomorphism problem reconsidered.
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Lower bounds on arithmetic circuits via partial derivatives
- Geometric complexity theory and matrix powering
- Wildness for tensors
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
- Geometric complexity theory: an introduction for geometers
- Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
- Computing the structure of finite algebras
- Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
- Partial Derivatives in Arithmetic Complexity and Beyond
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication
- On the Power of Homogeneous Depth 4 Arithmetic Circuits
- Arithmetic Circuits: A survey of recent results and open questions
- Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree
- Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications
- Computing Irreducible Representations of Finite Groups
- Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits
- Determinant Equivalence Test over Finite Fields and over Q
- Reconstruction of Full Rank Algebraic Branching Programs
- Learning Theory and Kernel Machines
- Affine projections of polynomials
- Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms
- Explicit $n$-descent on elliptic curves III. Algorithms
- STACS 2005
This page was built for publication:
