COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
Sum-of-squares proofsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact . A polynomial that is a sum of squares of other polynomials can only take nonnegative values. This trivial observation is surprisingly powerful: many inequalities in mathematics have simple sum-of-squares proofs. I will discuss algorithms that can automatically search for sum-of-squares proofs for polynomial inequalities, and the extent to which they can be considered as “automatic proof machines”. This talk is part of the Trinity Mathematical Society series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsCyber Security Society talks TCM Blackboard Series Cambridge Comparative Syntax Conference (CamCoS)Other talksPatients as Consumers and the Personalisation of Medicine (Reading Group) Many-electron quantum simulation of matter: insight from exact time-dependent real-space model systems Sychronized cells as a model for the diel regulation of Rubisco-EPYC1 interactions in the Chlamydomonas CCM When the search for Salmonella reveals more’ 'Yes You Do Need to Reference That': a Crash Course in Being an Ethical Researcher Statistics Clinic Lent 2019 - II |