Dietzfelbinger, Martin; Hühne, Martin Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape. (English) Zbl 0962.68066 Comput. Complexity 8, No. 4, 371-392 (1999). MSC: 68Q05 68Q25 03D15 68Q30 PDFBibTeX XMLCite \textit{M. Dietzfelbinger} and \textit{M. Hühne}, Comput. Complexity 8, No. 4, 371--392 (1999; Zbl 0962.68066) Full Text: DOI
Jukna, S.; Razborov, A.; Savický, P.; Wegener, I. On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs. (English) Zbl 0962.68075 Comput. Complexity 8, No. 4, 357-370 (1999). MSC: 68Q25 94C10 PDFBibTeX XMLCite \textit{S. Jukna} et al., Comput. Complexity 8, No. 4, 357--370 (1999; Zbl 0962.68075) Full Text: DOI
Ishihara, Hajime Function algebraic characterizations of the polytime functions. (English) Zbl 0962.68073 Comput. Complexity 8, No. 4, 346-356 (1999). MSC: 68Q15 PDFBibTeX XMLCite \textit{H. Ishihara}, Comput. Complexity 8, No. 4, 346--356 (1999; Zbl 0962.68073) Full Text: DOI
Ivanov, Sergei; de Rougemont, Michel Interactive protocols over the reals. (English) Zbl 0962.68113 Comput. Complexity 8, No. 4, 330-345 (1999). MSC: 68Q60 68Q15 68Q99 PDFBibTeX XMLCite \textit{S. Ivanov} and \textit{M. de Rougemont}, Comput. Complexity 8, No. 4, 330--345 (1999; Zbl 0962.68113) Full Text: DOI
Grigoriev, Dima Complexity lower bounds for randomized computation trees over zero characteristic fields. (English) Zbl 0961.68060 Comput. Complexity 8, No. 4, 316-329 (1999). MSC: 68Q25 PDFBibTeX XMLCite \textit{D. Grigoriev}, Comput. Complexity 8, No. 4, 316--329 (1999; Zbl 0961.68060) Full Text: DOI
Baur, Walter; Halupczok, Karin On lower bounds for the complexity of polynomials and their multiples. (English) Zbl 0962.68074 Comput. Complexity 8, No. 4, 309-315 (1999). MSC: 68Q25 PDFBibTeX XMLCite \textit{W. Baur} and \textit{K. Halupczok}, Comput. Complexity 8, No. 4, 309--315 (1999; Zbl 0962.68074) Full Text: DOI