umn logo IMA home |  Contact IMA 
IMA Web
Featured Videos:
Möbius Transformations Revealed Math and Science are all around us
(from ExxonMobil) 		Math and Science are everywhere
(from ExxonMobil)


Searching Results for W4.16-20.07:
On the number of homotopy types of fibres of a definable map, Saugata Basu  (Georgia Institute of Technology)
List decoding with optimal data rate, Venkat Guruswami  (University of Washington)
The tangent FFT, Daniel J. Bernstein  (University of Illinois)
Polynomial time algorithms to approximate mixed volumes within a simply exponential factor, Leonid Gurvits  (Los Alamos National Laboratory)
On Smale's 17th problem: a probabilistic solution in average polynomial time, Luis Miguel Pardo  (University of Cantabria)
Strongly self-orthogonal codes for secure computation, Iwan Duursma  (University of Illinois at Urbana-Champaign)
New recombination techniques for polynomial factorization algorithms based on Hensel lifting, Grégoire Lecerf  (Université Versailles/Saint Quentin-en-Yvelines)
The weight adjacency matrix of a convolutional code, Heide Gluesing-Luerssen  (University of Kentucky)
Decision versus evaluation in algebraic complexity theory, Pascal Koiran  (École Normale Supérieure de Lyon)
Ubiquity of Schubert varieties, V. Lakshmibai  (Northeastern University)
The probability that a slight perturbation of a numerical analysis problem is difficult, Peter Bürgisser  (Universität Paderborn)
Descartes rule for complete fields and arbitrary codimension, J. Maurice Rojas  (Texas A & M University)
Geometric complexity theory (GCT), Milind Sohoni  (Indian Institute of Technology)
©2006 Regents of the University of Minnesota. All rights reserved.
The University of Minnesota is an equal opportunity educator and employer.
Trouble seeing the text? | Contact U of M | Privacy
Last modified on