The following pages link to STACS 2005 (Q5710667):
Displaying 10 items.
- Classification problem for graphs and lattices is wild. (Q384722) (← links)
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms (Q2170103) (← links)
- Compact data structures for Dedekind groups and finite rings (Q2232236) (← links)
- Automorphisms of a certain class of completely primary finite rings (Q2895913) (← links)
- (Q3091085) (← links)
- (Q5089246) (← links)
- Determinant Equivalence Test over Finite Fields and over Q (Q5091219) (← links)
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)
- Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms (Q6566798) (← links)
- VDOO: a short, fast, post-quantum multivariate digital signature scheme (Q6623354) (← links)
