×

Found 6 Documents (Results 1–6)

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
Full Text: DOI

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

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

Filter Results by …

Document Type

all top 3

Main Field