STACS 2005
From MaRDI portal
Recommendations
Cited in
(15)- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Compact data structures for Dedekind groups and finite rings
- Automorphisms of a certain class of completely primary finite rings
- scientific article; zbMATH DE number 5946133 (Why is no real title available?)
- Classification problem for graphs and lattices is wild.
- scientific article; zbMATH DE number 7559443 (Why is no real title available?)
- Determinant Equivalence Test over Finite Fields and over Q
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
- VDOO: a short, fast, post-quantum multivariate digital signature scheme
- NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
- Solving systems of algebraic equations over finite commutative rings and applications
- Testing equivalence to design polynomials
- On the complexity of isomorphism problems for tensors, groups, and polynomials. I: Tensor isomorphism-completeness
- Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
This page was built for publication: STACS 2005
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710667)