Pages that link to "Item:Q5361871"
From MaRDI portal
The following pages link to Graph isomorphism in quasipolynomial time [extended abstract] (Q5361871):
Displayed 50 items.
- Public-key cryptosystem based on invariants of diagonalizable groups (Q524643) (← links)
- On the generalized spectral characterizations of Eulerian graphs (Q668057) (← links)
- Discrete-time quantum walk search on Johnson graphs (Q669924) (← links)
- Constructing cospectral bipartite graphs (Q785818) (← links)
- On fixity of arc-transitive graphs (Q824231) (← links)
- Graph isomorphism and Gaussian boson sampling (Q825567) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- QUBO formulations for the graph isomorphism problem and related problems (Q1682856) (← links)
- A graph isomorphism condition and equivalence of reaction systems (Q1682860) (← links)
- The resistance perturbation distance: a metric for the analysis of dynamic networks (Q1693161) (← links)
- Towards an isomorphism dichotomy for hereditary graph classes (Q1693994) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Network alignment by discrete Ollivier-Ricci flow (Q1725779) (← links)
- Uniquely pressable graphs: characterization, enumeration, and recognition (Q1755655) (← links)
- Two-line graphs of partial Latin rectangles (Q1792060) (← links)
- On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions (Q1979440) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- Constructing quantum hash functions based on quantum walks on Johnson graphs (Q1993776) (← links)
- Searching for square-complementary graphs: complexity of recognition and further nonexistence results (Q2022157) (← links)
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation (Q2023115) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- Sparse random matrices have simple spectrum (Q2028938) (← links)
- On short expressions for cosets of permutation subgroups (Q2033478) (← links)
- Inverse monoids of partial graph automorphisms (Q2038891) (← links)
- The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw (Q2045400) (← links)
- On the number of fixed points of automorphisms of vertex-transitive graphs (Q2064754) (← links)
- Primitive normalisers in quasipolynomial time (Q2071768) (← links)
- Fractional isomorphism of graphons (Q2095107) (← links)
- Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
- LESS-FM: fine-tuning signatures from the code equivalence problem (Q2118522) (← links)
- Computing normalisers of intransitive groups (Q2142483) (← links)
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed (Q2153303) (← links)
- A fast Fourier transform for the Johnson graph (Q2154368) (← 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)
- Robust worst cases for parity games algorithms (Q2182730) (← links)
- Space efficient representations of finite groups (Q2194866) (← links)
- Generalizations of \(k\)-dimensional Weisfeiler-Leman stabilization (Q2211259) (← links)
- Local WL invariance and hidden shades of regularity (Q2235273) (← links)
- The Weisfeiler-Leman algorithm and the diameter of Schreier graphs (Q2286350) (← links)
- Constructing non-isomorphic signless Laplacian cospectral graphs (Q2297737) (← links)
- Refining invariants for computing autotopism groups of partial Latin rectangles (Q2305926) (← links)
- A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum (Q2317643) (← links)
- Knowledge representation analysis of graph mining (Q2317967) (← links)
- Finding fixed point free elements and small bases in permutation groups (Q2357380) (← links)
- Exponentially many graphs have a \(Q\)-cospectral mate (Q2359949) (← links)
- Zero knowledge and circuit minimization (Q2407082) (← links)
- Baby-step giant-step algorithms for the symmetric group (Q2409009) (← links)