scientific article; zbMATH DE number 5605063
From MaRDI portal
Publication:3396558
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)
Cited in
(13)- The QAP-polytope and the graph isomorphism problem
- Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs
- A fast Fourier transform for the Johnson graph
- Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism
- Zero knowledge and circuit minimization
- Isomorphism testing of read-once functions and polynomials
- On the Complexity of Matroid Isomorphism Problems
- From Invariants to Canonization in Parallel
- Lorentzian spectral geometry with causal sets
- Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- On the complexity of matroid isomorphism problem
- On p-group isomorphism: search-to-decision, counting-to-decision and nilpotency class reductions via tensors
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396558)
