Assembling Molecules in Atomix is Hard

Assembling Molecules in Atomix is Hard (2001)

by Markus Holzer , Stefan Schwoon

Citations:

10 - 1 self

Datum	Value	Source
TITLE	Assembling molecules in Atomix is hard	INFERENCE
AUTHOR NAME	Markus Holzer	SVM HeaderParse 0.1
AUTHOR AFFIL	Institut fur Informatik, Technische Universitat Munchen	SVM HeaderParse 0.2
AUTHOR ADDR	Arcisstrae 21, 80290 Munchen, Germany	SVM HeaderParse 0.1
AUTHOR NAME	Stefan Schwoon	SVM HeaderParse 0.1
AUTHOR AFFIL	Institut fur Informatik, Technische Universitat Munchen	SVM HeaderParse 0.2
AUTHOR ADDR	Arcisstrae 21, 80290 Munchen, Germany	SVM HeaderParse 0.1
ABSTRACT	. It is shown that assembling molecules in the Atomix game can be used to simulate nite automata. In particular, an instance of Atomix is constructed that has a solution if and only if the non-emptiness intersection problem for nite automata is solvable. This shows that the game under consideration is PSPACE-complete, improving a recent result of Huner et al. [9]. 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. 1	user correction - Legacy Corrections
YEAR	2001	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Technical Report 0101	INFERENCE
CITATIONS	13 found	ParsCit 1.0