Malod, Guillaume Succinct algebraic branching programs characterizing non-uniform complexity classes. (English) Zbl 1342.68137 Owe, Olaf (ed.) et al., Fundamentals of computation theory. 18th international symposium, FCT 2011, Oslo, Norway, August 22–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22952-7/pbk). Lecture Notes in Computer Science 6914, 205-216 (2011). MSC: 68Q15 68P05 PDFBibTeX XMLCite \textit{G. Malod}, Lect. Notes Comput. Sci. 6914, 205--216 (2011; Zbl 1342.68137) Full Text: DOI
Pavan, A.; Wang, Fengming Robustness of PSPACE-complete sets. (English) Zbl 1187.68252 Inf. Process. Lett. 103, No. 3, 102-104 (2007). MSC: 68Q17 03D15 68Q15 PDFBibTeX XMLCite \textit{A. Pavan} and \textit{F. Wang}, Inf. Process. Lett. 103, No. 3, 102--104 (2007; Zbl 1187.68252) Full Text: DOI
Glaßer, Christian; Ogihara, Mitsunori; Pavan, A.; Selman, Alan L.; Zhang, Liyu Autoreducibility, mitoticity, and immunity. (English) Zbl 1115.68087 J. Comput. Syst. Sci. 73, No. 5, 735-754 (2007). MSC: 68Q17 68Q15 PDFBibTeX XMLCite \textit{C. Glaßer} et al., J. Comput. Syst. Sci. 73, No. 5, 735--754 (2007; Zbl 1115.68087) Full Text: DOI
Böhler, E.; Glaßer, C.; Schwarz, B.; Wagner, K. W. Generation problems. (English) Zbl 1080.68038 Theor. Comput. Sci. 345, No. 2-3, 260-295 (2005). MSC: 68Q25 68Q15 68Q17 PDFBibTeX XMLCite \textit{E. Böhler} et al., Theor. Comput. Sci. 345, No. 2--3, 260--295 (2005; Zbl 1080.68038) Full Text: DOI
Galota, Matthias; Vollmer, Heribert Functions computable in polynomial space. (English) Zbl 1067.68073 Inf. Comput. 198, No. 1, 56-70 (2005). MSC: 68Q10 68Q15 68Q05 PDFBibTeX XMLCite \textit{M. Galota} and \textit{H. Vollmer}, Inf. Comput. 198, No. 1, 56--70 (2005; Zbl 1067.68073) Full Text: DOI
Hemaspaandra, Lane A.; Hempel, Harald; Wechsung, Gerd Self-specifying machines. (English) Zbl 1319.68083 Int. J. Found. Comput. Sci. 10, No. 3, 263-276 (1999). MSC: 68Q05 68Q15 68Q45 PDFBibTeX XMLCite \textit{L. A. Hemaspaandra} et al., Int. J. Found. Comput. Sci. 10, No. 3, 263--276 (1999; Zbl 1319.68083) Full Text: DOI
Baier, Herbert; Wagner, Klaus W. Bounding queries in the analytic polynomial-time hierarchy. (English) Zbl 0916.68058 Theor. Comput. Sci. 207, No. 1, 89-104 (1998). MSC: 68Q15 PDFBibTeX XMLCite \textit{H. Baier} and \textit{K. W. Wagner}, Theor. Comput. Sci. 207, No. 1, 89--104 (1998; Zbl 0916.68058) Full Text: DOI
Veith, Helmut Succinct representation, leaf languages, and projection reductions. (English) Zbl 0909.68079 Inf. Comput. 142, No. 2, 207-236 (1998). MSC: 68Q15 PDFBibTeX XMLCite \textit{H. Veith}, Inf. Comput. 142, No. 2, 207--236 (1998; Zbl 0909.68079) Full Text: DOI
Hertrampf, Ulrich Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria. (English) Zbl 1508.68121 Chlebus, Bogdan S. (ed.) et al., Fundamentals of computation theory. 11th international symposium, FCT ’97, Jagiellonian Univ., Kraków, Poland, September 1–3, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1279, 233-244 (1997). MSC: 68Q15 20F10 20M05 68Q04 PDFBibTeX XMLCite \textit{U. Hertrampf}, Lect. Notes Comput. Sci. 1279, 233--244 (1997; Zbl 1508.68121) Full Text: DOI
Clote, P. Nondeterministic stack register machines. (English) Zbl 0901.68052 Theor. Comput. Sci. 178, No. 1-2, 37-76 (1997). MSC: 68Q05 PDFBibTeX XMLCite \textit{P. Clote}, Theor. Comput. Sci. 178, No. 1--2, 37--76 (1997; Zbl 0901.68052) Full Text: DOI
Hemaspaandra, Lane A.; Ogihara, Mitsunori Universally serializable computation. (English) Zbl 0901.68065 J. Comput. Syst. Sci. 55, No. 3, 547-560 (1997). MSC: 68Q05 PDFBibTeX XMLCite \textit{L. A. Hemaspaandra} and \textit{M. Ogihara}, J. Comput. Syst. Sci. 55, No. 3, 547--560 (1997; Zbl 0901.68065) Full Text: DOI Link
Hemaspaandra, Lane A.; Torenvliet, Leen Optimal advice. (English) Zbl 0872.68042 Theor. Comput. Sci. 154, No. 2, 367-377 (1996). MSC: 68Q15 PDFBibTeX XMLCite \textit{L. A. Hemaspaandra} and \textit{L. Torenvliet}, Theor. Comput. Sci. 154, No. 2, 367--377 (1996; Zbl 0872.68042) Full Text: DOI