scientific article
From MaRDI portal
Publication:3396558
zbMath1169.68440MaRDI QIDQ3396558
Publication date: 19 September 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (12)
The QAP-polytope and the graph isomorphism problem ⋮ A fast Fourier transform for the Johnson graph ⋮ Zero knowledge and circuit minimization ⋮ Isomorphism testing of read-once functions and polynomials ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ From Invariants to Canonization in Parallel ⋮ Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating ⋮ On the complexity of matroid isomorphism problem ⋮ Lorentzian spectral geometry with causal sets ⋮ Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs ⋮ Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism ⋮ On the Complexity of Matroid Isomorphism Problems
This page was built for publication:
