Book, Ronald V.; Vollmer, Heribert; Wagner, Klaus W. Probabilistic type-2 operators and “almost”-classes. (English) Zbl 0913.68071 Comput. Complexity 7, No. 3, 265-289 (1998). MSC: 68Q05 68Q10 68Q15 PDFBibTeX XMLCite \textit{R. V. Book} et al., Comput. Complexity 7, No. 3, 265--289 (1998; Zbl 0913.68071) Full Text: DOI
Egidi, Lavinia A quantifier elimination for the theory of \(p\)-adic numbers. (English) Zbl 0922.11108 Comput. Complexity 7, No. 3, 205-263 (1998). Reviewer: G.Pestov (Tomsk) MSC: 11U05 03C60 03C10 68Q25 PDFBibTeX XMLCite \textit{L. Egidi}, Comput. Complexity 7, No. 3, 205--263 (1998; Zbl 0922.11108) Full Text: DOI
Grigoriev, Dima; Karpinski, Marek; Yao, Andrew C. An exponential lower bound on the size of algebraic decision trees for MAX. (English) Zbl 0918.68032 Comput. Complexity 7, No. 3, 193-203 (1998). MSC: 68Q15 68Q25 68W30 PDFBibTeX XMLCite \textit{D. Grigoriev} et al., Comput. Complexity 7, No. 3, 193--203 (1998; Zbl 0918.68032) Full Text: DOI HAL