The computational complexity of equivalence and isomorphism problems
From MaRDI portal
Publication:1581496
DOI10.1007/3-540-45303-2zbMath0966.68083OpenAlexW1517154004MaRDI QIDQ1581496
Publication date: 18 October 2000
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45303-2
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Randomized algorithms (68W20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
Equilibria problems on games: complexity versus succinctness ⋮ Complexity classes of equivalence problems revisited ⋮ On the isomorphism problem for decision trees and decision lists
This page was built for publication: The computational complexity of equivalence and isomorphism problems
