On the Complexity of Game Isomorphism

DOI10.1007/978-3-540-74456-6_50zbMath1147.91303OpenAlexW1858172269MaRDI QIDQ3525601

Alina García, Joaquim Gabarró, Maria J. Serna

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_50

zbMATH Keywords

computational complexitygraph isomorphismBoolean formulasgame isomorphismsuccinct representationsBoolean isomorphism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Some results of Maria Serna on strategic games: complexity of equilibria and models ⋮ Equilibria problems on games: complexity versus succinctness ⋮ On the complexity of deciding bimatrix games similarity

This page was built for publication: On the Complexity of Game Isomorphism