Geffert, Viliam; Pardubská, Dana Unary coded NP-complete languages in \(\mathrm{ASpace}(\log \log n)\). (English) Zbl 1298.68134 Int. J. Found. Comput. Sci. 24, No. 7, 1167-1182 (2013). MSC: 68Q45 68Q15 68Q17 PDF BibTeX XML Cite \textit{V. Geffert} and \textit{D. Pardubská}, Int. J. Found. Comput. Sci. 24, No. 7, 1167--1182 (2013; Zbl 1298.68134) Full Text: DOI
Geffert, Viliam; Pardubská, Dana Factoring and testing primes in small space. (English) Zbl 1315.11100 RAIRO, Theor. Inform. Appl. 47, No. 3, 241-259 (2013). MSC: 11Y16 11A51 68Q05 68Q15 68Q17 PDF BibTeX XML Cite \textit{V. Geffert} and \textit{D. Pardubská}, RAIRO, Theor. Inform. Appl. 47, No. 3, 241--259 (2013; Zbl 1315.11100) Full Text: DOI
Geffert, Viliam; Pardubská, Dana Unary coded NP-complete languages in \(\mathrm{ASpace}(\log\log n)\). (English) Zbl 1316.68062 Yen, Hsu-Chun (ed.) et al., Developments in language theory. 16th international conference, DLT 2012, Taipei, Taiwan, August 14–17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31652-4/pbk). Lecture Notes in Computer Science 7410, 166-177 (2012). MSC: 68Q45 68Q15 68Q17 PDF BibTeX XML Cite \textit{V. Geffert} and \textit{D. Pardubská}, Lect. Notes Comput. Sci. 7410, 166--177 (2012; Zbl 1316.68062) Full Text: DOI
Geffert, Viliam; Pardubská, Dana Factoring and testing primes in small space. (English) Zbl 1206.68144 Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24–30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 291-302 (2009). MSC: 68Q25 11A41 11Y16 68Q05 PDF BibTeX XML Cite \textit{V. Geffert} and \textit{D. Pardubská}, Lect. Notes Comput. Sci. 5404, 291--302 (2009; Zbl 1206.68144) Full Text: DOI