Grigoriev, Dima; Karpinski, Marek; Meyer auf der Heide, Friedhelm; Smolensky, Roman A lower bound for randomized algebraic decision trees. (English) Zbl 0895.68049 Comput. Complexity 6(1996-97), No. 4, 357-375 (1997). MSC: 68Q15 68W30 68Q25 PDFBibTeX XMLCite \textit{D. Grigoriev} et al., Comput. Complexity 6, No. 4, 357--375 (1997; Zbl 0895.68049) Full Text: DOI
Grigoriev, Dima; Karpinski, Marek; Meyer auf der Heide, Friedhelm; Smolensky, Roman A lower bound for randomized algebraic decision trees. (English) Zbl 0922.68090 Proceedings of the 28th annual ACM symposium on the theory of computing (STOC). Philadelphia, PA, USA, May 22–24, 1996. New York, NY: ACM, 612-619 (1996). MSC: 68R10 05C05 PDFBibTeX XMLCite \textit{D. Grigoriev} et al., in: Proceedings of the 28th annual ACM symposium on the theory of computing, STOC '96. Philadelphia, PA, USA, May 22--24, 1996. New York, NY: ACM. 612--619 (1996; Zbl 0922.68090)
Meyer auf der Heide, Friedhelm On genuinely time bounded computations. (English) Zbl 1492.68056 Monien, Burkhard (ed.) et al., STACS 89. 6th annual symposium on theoretical aspects of computer science, Paderborn, FRG, February 16–18, 1989. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 349, 1-16 (1989). MSC: 68Q15 03D15 PDFBibTeX XMLCite \textit{F. Meyer auf der Heide}, Lect. Notes Comput. Sci. 349, 1--16 (1989; Zbl 1492.68056) Full Text: DOI
Meyer auf der Heide, Friedhelm Lower bounds for solving linear diophantine equations on random access machines. (English) Zbl 0633.68031 J. Assoc. Comput. Mach. 32, 929-937 (1985). MSC: 68Q25 90C10 68W99 11D04 PDFBibTeX XMLCite \textit{F. Meyer auf der Heide}, J. Assoc. Comput. Mach. 32, 929--937 (1985; Zbl 0633.68031) Full Text: DOI Link
Meyer auf der Heide, Friedhelm Lower time bounds for solving linear diophantine equations on several parallel computational models. (English) Zbl 0588.68025 Inf. Control 67, 195-211 (1985). MSC: 68Q25 68Q05 11D04 PDFBibTeX XMLCite \textit{F. Meyer auf der Heide}, Inf. Control 67, 195--211 (1985; Zbl 0588.68025) Full Text: DOI
Meyer auf der Heide, Friedhelm A polynomial linear search algorithm for the \(n\)-dimensional knapsack problem. (English) Zbl 0631.68037 J. Assoc. Comput. Mach. 31, 668-676 (1984). MSC: 68Q25 90C05 PDFBibTeX XMLCite \textit{F. Meyer auf der Heide}, J. Assoc. Comput. Mach. 31, 668--676 (1984; Zbl 0631.68037) Full Text: DOI