On the complexity of identifying strongly regular graphs
From MaRDI portal
Publication:6072032
Recommendations
Cites work
- A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
- A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
- A note on the graph isomorphism counting problem
- An Efficient Algorithm for Graph Isomorphism
- An exponential lower bound for individualization-refinement algorithms for graph isomorphism
- An optimal lower bound on the number of variables for graph identification
- Automorphism group computation and isomorphism testing in finite groups
- Computational Complexity
- Computational complexity of k-block conjugacy
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- Concerning the complexity of deciding isomorphism of block designs
- CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
- Construction of finite groups
- Finite nets. II: Uniqueness and imbedding
- Graph isomorphism in quasipolynomial time (extended abstract)
- Graph Isomorphism is in SPP
- Graph isomorphism is in the low hierarchy
- Graph isomorphism is low for PP
- Graph isomorphism is not \(\mathsf{AC}^{0}\)-reducible to group isomorphism
- Graph isomorphism problem
- scientific article; zbMATH DE number 3663155 (Why is no real title available?)
- scientific article; zbMATH DE number 1256777 (Why is no real title available?)
- scientific article; zbMATH DE number 1318518 (Why is no real title available?)
- scientific article; zbMATH DE number 3326518 (Why is no real title available?)
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems
- Mutually orthogonal Latin squares and self-complementary designs
- Nondeterministics circuits, space complexity and quasigroups
- On Cyclic Steiner 2-Designs
- On t-designs
- On the \(n\log{n}\) isomorphism technique (preliminary report)
- On the automorphism groups of strongly regular graphs. I
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- On the complexity of some problems on groups input as multiplication tables
- On the Hardness of Graph Isomorphism
- On the order of uniprimitive permutation groups
- On the ratio of optimal integral and fractional covers
- On the Structure of Polynomial Time Reducibility
- Quasigroups. I
- Quasipolynomial-time canonical form for steiner designs
- Strongly regular graphs with smallest eigenvalue -m
- Strongly regular graphs, partial geometries and partially balanced designs
- Testing Graph Isomorphism in Parallel by Playing a Game
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
- The threshold for subgroup profiles to agree is \Omega(\log n)
- Which problems have strongly exponential complexity?
Cited in
(5)- scientific article; zbMATH DE number 4193150 (Why is no real title available?)
- scientific article; zbMATH DE number 3874608 (Why is no real title available?)
- A fast new algorithm for weak graph regularity
- On the constant-depth circuit complexity of generating quasigroups
- Constant depth circuit complexity for generating quasigroups
This page was built for publication: On the complexity of identifying strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072032)
