The complexity of game isomorphism-Reference-Cited by-同舟云学术

The complexity of game isomorphism

Published:2011-11 Issue:48 Volume:412 Page:6675-6695
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Gabarró Joaquim,García Alina,Serna Maria

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference27 articles.

1. The formula isomorphism problem;Agrawal;SIAM J. Comput.,2000

2. Equilibria problems on games: Complexity versus succinctness;Àlvarez;Journal of Computer and System Sciences,2011

3. Monotone circuits for monotone weighted threshold functions;Beimel;Inform. Process. Lett.,2006

4. E. Bonzon, M.-C. Lagasquie-Schiex, J. Lang, B. Zanuttini, Boolean games revisited, in: ECAI 2006, 17th European Conference on Artificial Intelligence, 2006, pp. 265–269.

5. On the computational complexity of some classical equivalence relations on boolean functions;Borchet;Theory Comput. Syst.,1998

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Complexity of equilibria in binary public goods games on undirected graphs;Proceedings of the 24th ACM Conference on Economics and Computation;2023-07-07

2. Quantification and statistical analysis of topological features of recursive trees;Physica A: Statistical Mechanics and its Applications;2023-05

3. Project games;Theoretical Computer Science;2023-01

4. Safe Pareto improvements for delegated game playing;Autonomous Agents and Multi-Agent Systems;2022-08-13

5. General features of Nash equilibria in combinations of elementary interactions in symmetric two-person games;The European Physical Journal B;2021-05