Determinant Equivalence Test over Finite Fields and over Q
From MaRDI portal
Publication:5091219
DOI10.4230/LIPIcs.ICALP.2019.62OpenAlexW2964618668MaRDI QIDQ5091219
Ankit Garg, Chandan Saha, N. Gupta, Neeraj Kayal
Publication date: 21 July 2022
Full work available at URL: https://dblp.uni-trier.de/db/conf/icalp/icalp2019.html#GargGK019
Related Items (3)
Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ Unnamed Item ⋮ Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Splitting full matrix algebras over algebraic number fields.
- Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\)
- Computer construction of split Cartan subalgebras
- Calculating the structure of a semisimple Lie algebra
- Algebra. Volume II: Fields with structure, algebras and advanced topics. Transl. from the German by Silvio Levy. With the collaboration of the translator
- Computing the structure of finite algebras
- Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q
- Computing Irreducible Representations of Finite Groups
- Reconstruction of Full Rank Algebraic Branching Programs
- 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: Determinant Equivalence Test over Finite Fields and over Q
