Certifying Solutions to Overdetermined and Singular Polynomial Systems over Q

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


Duration: 30:46
112 views
0

Agnes Szanto, North Carolina State University
Solving Polynomial Equations
http://simons.berkeley.edu/talks/agnes-szanto-2014-10-14



Other Videos By Simons Institute for the Theory of Computing


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-21Solving Polynomial Equations in Smoothed Polynomial Time
2014-10-21Generalized Mixed Volume of Polynomial Systems
2014-10-21Arithmetic Nullstellensätze and Applications
2014-10-21Polynomial Systems Arising in the Study of Biochemical Reaction Networks
2014-10-21A Complexity Theory for Constructible Functions and Sheaves
2014-10-21Degree of Central Curve in Quadratic Programming
2014-10-21Matrix Completion for the Independence Model
2014-10-21Mixed Volume Computation in (another) Mixed Volume Time
2014-10-21Chordal Structure and Polynomial Systems
2014-10-21Some Results and Questions as to the Complexity of the (Eigenvalue, Eigenvector) Problem


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