scientific article; zbMATH DE number 5605063
From MaRDI portal
Publication:3396558
zbMATH Open1169.68440MaRDI QIDQ3396558FDOQ3396558
Authors: Vikraman Arvind, Jacobo Torán 
Publication date: 19 September 2009
Title of this publication is not available (Why is that?)
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (12)
- Zero knowledge and circuit minimization
- The QAP-polytope and the graph isomorphism problem
- Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating
- Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs
- A fast Fourier transform for the Johnson graph
- On the Complexity of Matroid Isomorphism Problems
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- Isomorphism testing of read-once functions and polynomials
- Lorentzian spectral geometry with causal sets
- On the complexity of matroid isomorphism problem
- From Invariants to Canonization in Parallel
- Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism
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)
