scientific article; zbMATH DE number 7771724

zbMath1527.05178arXiv2207.05930MaRDI QIDQ6072032

Publication date: 29 November 2023

Full work available at URL: https://arxiv.org/abs/2207.05930

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

limited nondeterminism isomorphism problems

Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
Graph isomorphism problem
Graph isomorphism is in the low hierarchy
Concerning the complexity of deciding isomorphism of block designs
On the order of uniprimitive permutation groups
Isomorphism of graphs of bounded valence can be tested in polynomial time
An optimal lower bound on the number of variables for graph identification
Graph isomorphism is low for PP
On the ratio of optimal integral and fractional covers
On t-designs
A note on the graph isomorphism counting problem
Strongly regular graphs with smallest eigenvalue -m
Construction of finite groups
Nondeterministics circuits, space complexity and quasigroups
Automorphism group computation and isomorphism testing in finite groups
Which problems have strongly exponential complexity?
Computational complexity of $k$-block conjugacy
Graph Isomorphism is in SPP
Strongly regular graphs, partial geometries and partially balanced designs
Finite nets. II: Uniqueness and imbedding
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
On the automorphism groups of strongly regular graphs I
Testing Graph Isomorphism in Parallel by Playing a Game
On Cyclic Steiner 2-Designs
On the Complexity of Canonical Labeling of Strongly Regular Graphs
On the Structure of Polynomial Time Reducibility
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
On the Hardness of Graph Isomorphism
A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
The threshold for subgroup profiles to agree is $\Omega(\log n)$
An exponential lower bound for individualization-refinement algorithms for graph isomorphism
Computational Complexity
Graph isomorphism in quasipolynomial time [extended abstract]
On the n^{log n} isomorphism technique (A Preliminary Report)
Quasipolynomial-time canonical form for steiner designs
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
An Efficient Algorithm for Graph Isomorphism
Quasigroups. I
On the complexity of some problems on groups input as multiplication tables

This page was built for publication: