Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP

Hermann Gruber, Markus Holzer. Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. In Tero Harju, Juhani Karhumäki, Arto Lepistö, editors, Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings. Volume 4588 of Lecture Notes in Computer Science, pages 205-216, Springer, 2007. [doi]

Abstract

Abstract is missing.