Hex ist PSPACE-vollst�ndig
Acta Informatica1981Vol. 15(2), pp. 167–191
Citations Over TimeTop 10% of 1981 papers
Related Papers
- → Lower-Bound Constrained Runs in Weighted Timed Automata(2012)12 cited
- → Lower-bound-constrained runs in weighted timed automata(2013)15 cited
- → SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS(2014)1 cited
- → Length-Increasing Reductions for PSPACE-Completeness(2013)
- → Some Decision Questions Concerning the Time Complexity of Language Acceptors(2013)