Blömer, Johannes; Seifert, Jean-Pierre On the complexity of computing short linearly independent vectors and short bases in a lattice. (English) Zbl 1345.11090 Vitter, Jeffrey Scott (ed.) et al., Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1–4, 1999. New York, NY: ACM, Association for Computing Machinery (ISBN 1-58113-067-8). 711-720 (1999). MSC: 11Y16 11H06 68Q17 PDFBibTeX XMLCite \textit{J. Blömer} and \textit{J.-P. Seifert}, in: Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1--4, 1999. New York, NY: ACM, Association for Computing Machinery. 711--720 (1999; Zbl 1345.11090) Full Text: DOI
Havas, George; Seifert, Jean-Pierre The complexity of the extended GCD problem. (English) Zbl 0996.11077 Kutyłowski, Mirosław (ed.) et al., Mathematical foundations of computer science 1999. 24th international symposium, MFCS ’99, Szklarska Porȩba, Poland, September 6-10, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1672, 103-113 (1999). MSC: 11Y16 68W25 11Y50 PDFBibTeX XMLCite \textit{G. Havas} and \textit{J.-P. Seifert}, Lect. Notes Comput. Sci. 1672, 103--113 (1999; Zbl 0996.11077)
Wang, Jie Packing of unequal spheres and automated radiosurgical treatment planning. (English) Zbl 0958.90086 J. Comb. Optim. 3, No. 4, 453-463 (1999). MSC: 90C39 05B40 52C17 68Q17 68R05 90C35 92C50 PDFBibTeX XMLCite \textit{J. Wang}, J. Comb. Optim. 3, No. 4, 453--463 (1999; Zbl 0958.90086) Full Text: DOI
Kosheleva, Olga; Kreinovich, Vladik Error estimation for indirect measurements: Interval computation problem is (slightly) harder than a similar probabilistic computational problem. (English) Zbl 0942.65047 Reliab. Comput. 5, No. 1, 81-95 (1999). Reviewer: S.Markov (Sofia) MSC: 65G30 68Q17 65Y20 PDFBibTeX XMLCite \textit{O. Kosheleva} and \textit{V. Kreinovich}, Reliab. Comput. 5, No. 1, 81--95 (1999; Zbl 0942.65047) Full Text: DOI
Fekete, Sándor P. Simplicity and hardeness of the maximum traveling salesman problem under geometric distances. (English) Zbl 0944.90104 Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17-19, 1999. Philadelphia, PA: SIAM. 337-345 (1999). MSC: 90C60 PDFBibTeX XMLCite \textit{S. P. Fekete}, in: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, SODA '99. Baltimore, MD, USA, January 17--19, 1999. Philadelphia, PA: SIAM. 337--345 (1999; Zbl 0944.90104)
Gritzmann, Peter; Hufnagel, Alexander On the algorithmic complexity of Minkowski’s reconstruction theorem. (English) Zbl 0935.52014 J. Lond. Math. Soc., II. Ser. 59, No. 3, 1081-1100 (1999). Reviewer: Peter Gritzmann (München) MSC: 52B55 68U05 90C25 52B11 52A20 52A39 68W10 68Q25 68P05 90C30 PDFBibTeX XML Full Text: DOI