Pages that link to "Item:Q4924412"
From MaRDI portal
The following pages link to Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem (Q4924412):
Displaying 17 items.
- On the complexity of polytope isomorphism problems (Q1401558) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms (Q2170103) (← links)
- General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case (Q2349096) (← links)
- Functional approach to the Hamiltonian circuit and graph isomorphism problems (Q2452948) (← links)
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing (Q4634059) (← links)
- Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption (Q5041229) (← links)
- (Q5052940) (← links)
- GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM (Q5122158) (← links)
- Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs (Q5410645) (← links)
- Hardness estimates of the code equivalence problem in the rank metric (Q6130620) (← links)
- Algebraic algorithm for the alternating trilinear form equivalence problem (Q6550580) (← links)
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants (Q6637328) (← links)
- Practical attack on all parameters of the DME signature scheme (Q6637713) (← links)
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme (Q6648191) (← links)
