A Theory of Complexity, Condition and Roundoff

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=AQJeDuH6BQE


Duration: 27:23
294 views
2

Felipe Cucker, City University of Hong Kong
Solving Polynomial Equations
http://simons.berkeley.edu/talks/felipe-cucker-2014-10-16



Other Videos By Simons Institute for the Theory of Computing


2014-11-03The Impact of Regularization in Spectral Clustering
2014-11-03Spectral Algorithms for Learning Latent Variable Models
2014-11-03Some Probabilistic Uses of Dirichlet Eigenvectors
2014-11-03Multiscale Analysis on and of Graphs
2014-11-03Applied Hodge Theory
2014-11-03The Hidden Convexity of Spectral Clustering
2014-11-03On the Estimation of the Cheeger Constant
2014-11-03Tensor Methods for Learning Latent Variable Models: Theory and Practice
2014-11-03Robust Spectral Diffusions for Data Applications
2014-11-03Multiresolution Graph Models
2014-10-21A Theory of Complexity, Condition and Roundoff
2014-10-21Bertini_real: Software for Real Algebraic Sets
2014-10-21Characterization of the Affine Solutions of Sparse Polynomial Systems
2014-10-21Advances in Numerical Algebraic Geometry with Applications
2014-10-21Numerical Algebraic Geometry for Maximum Likelihood Estimation
2014-10-21Identifiability of Viscoelastic Mechanical Systems
2014-10-21Certifying Solutions to Overdetermined and Singular Polynomial Systems over Q
2014-10-21On the Intersection of a Sparse Curve and a Low-degree Curve: A Polynomial Version of the Lost Theor
2014-10-21Recent Progress on Computing Groebner Bases
2014-10-21Families of Anticommuting Matrices and the Sum of Squares Problem
2014-10-21On the Critical Point Method and Deciding Connectivity Queries in Real Algebraic Sets


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithms and Complexity in Algebraic Geometry
Felipe Cucker