On the complexity of the relative eigenvector problem
From MaRDI portal
Cites work
- A polynomial-time key-recovery attack on MQQ cryptosystems
- A rank-updating technique for the Kronecker canonical form of singular pencils
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Conjugacy of embeddings of alternating groups in exceptional Lie groups
- Construction of some irreducible subgroups of E₈ and E₆.
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
- Cryptanalysis of MinRank
- Embeddings of \(\text{SL}(2,27)\) in complex exceptional algebraic groups.
- Examples for embeddings of groups \(\text{PSL}_ 2(F_ p)\) into simple Lie groups
- scientific article; zbMATH DE number 4067257 (Why is no real title available?)
- scientific article; zbMATH DE number 2081078 (Why is no real title available?)
- scientific article; zbMATH DE number 1418284 (Why is no real title available?)
- Improvement of algebraic attacks for solving superdetermined MinRank instances
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- On the complexity of ``Superdetermined minrank instances
- On the complexity of the generalized MinRank problem
- Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations
- Real root finding for determinants of linear matrices
- Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced
- Semilinear tensor decompositions
- The computational complexity of some problems of linear algebra
- The computational matrix group project.
- The eigenvalue problem \(\lambda Tx+Sx\)
- The Magma algebra system. I: The user language
This page was built for publication: On the complexity of the relative eigenvector problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288973)
