Tuesday, January 11

Session 12C

4:15 PM-5:55 PM
Room: Gold Rush B

4:15 Finding the Closest Lattice Vector When It's Unusually Close
Philip N. Klein, Brown University
4:40 A New Bound for the Carathéodory Rank of the Bases of a Matroid
J. C. de Pina and J. Soares, Universidade de São Paolo, Brazil
5:05 Minimum Ratio Canceling is Oracle Polynomial for Linear Programming, but Not Strongly Polynomial, Even for Networks
S. Thomas McCormick, University of British Columbia, Canada; and Akiyoshi Shioura, Sophia University, Japan
5:30 Nearly Optimal Computations with Structured Matrices
Victor Y. Pan, Lehman College, City University of New York

© 1999, Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 11/7/99; Last Updated 11/7/99