Pages that link to "Item:Q5890037"

The following pages link to On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037):

Displaying 6 items.

• General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
• Algebraic algorithm for the alternating trilinear form equivalence problem (Q6550580) (← links)
• Monomial isomorphism for tensors and applications to code equivalence problems (Q6564091) (← links)
• Non-interactive commitment from non-transitive group actions (Q6595925) (← links)
• Representations of group actions and their applications in cryptography (Q6615541) (← links)
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants (Q6637328) (← links)