Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications - Assembling Molecules in Atomix is Hard


Markus Holzer and Stefan Schwoon. Assembling molecules in Atomix is hard. Technical Report TUM-I0101, Technische Universität München, May 2001.


It is shown that assembling molecules in the Atomix game can be used to simulate finite automata. In particular, an instance of Atomix is constructed that has a solution if and only if the non-emptiness intersection problem for finite automata is solvable. This shows that the game under consideration is PSPACE-complete, improving a recent result of Hüffner et al. Thus, there are Atomix games which have superpolynomially long optimal solutions. We also give an easy construction of Atomix game levels whose optimal solutions meet the worst case.

Suggested BibTeX entry:

    author = {Markus Holzer and Stefan Schwoon},
    institution = {Technische Universit{\"a}t M{\"u}nchen},
    month = {May},
    number = {TUM-I0101},
    title = {Assembling Molecules in {A}tomix is Hard},
    year = {2001}

GZipped PostScript (75 kB)
Journal version