The HOM problem is decidable - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Guillem Godoy, Omer Giménez, Lander Ramos, Carme Àlvarez. The HOM problem is decidable. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. pages 485-494, ACM, 2010. [doi]

The following publications are possibly variants of this publication:

The HOM problem is decidableGuillem Godoy, Omer Giménez. JACM, 60(4):23, 2013. [doi]

The HOM Problem is EXPTIME-CompleteCarles Creus, Adria Gascón, Guillem Godoy, Lander Ramos. lics 2012: 255-264 [doi]

The HOM Problem is EXPTIME-CompleteCarles Creus, Adria Gascón, Guillem Godoy, Lander Ramos. SICOMP, 45(4):1230-1260, 2016. [doi]

runs on WebDSL