On the hardness of game equivalence under local isomorphism

DOI10.1051/ITA/2012024MaRDI QIDQ4928764zbMATH OpenOpenAlexFDO

Authors Joaquim Gabarró, Alina García, Maria Serna

Publication date 18 June 2013

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2013__47_2_147_0/

zbMATH Keywords

Boolean formula isomorphismcircuit isomorphismcomputational complexityformula gamesgame isomorphismgraph isomorphismstrategic gamessuccinct representations

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Spaces of games (91A70)

Recommendations

• On the Complexity of Game Isomorphism
• The complexity of game isomorphism
• Weak isomorphism of extensive games.
• scientific article; zbMATH DE number 2243403
• A note on isomorphism and strategic equivalence of cooperative games

Cited in

(5)

• Weak isomorphism of extensive games.
• Isomorphism in 3-person games
• On the Complexity of Game Isomorphism
• The complexity of game isomorphism
• A note on isomorphism and strategic equivalence of cooperative games

This page was built for publication: On the hardness of game equivalence under local isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928764)