Search for tag: "bounds"

Succinct semi-algebraic representations and computational variants of the generalized Lax conjecture - Rafael Mendes de Oliveira

Mathematical Approaches to Lower Bounds: Complexity of Proofs and Computation Succinct semi-algebraic representations and computational variants of the generalized Lax conjecture by Rafael Mendes…

From  Iain Cms 0 likes 7 plays 0  

Ideals, determinants, and straightening - Robert Andrews

Mathematical Approaches to Lower Bounds: Complexity of Proofs and Computation Ideals, determinants, and straightening by Robert Andrews, University of Illinois at Urbana Champagne

From  Iain Cms 0 likes 5 plays 0  

Lower bounds for symmetric arithmetic circuits - Anuj Dawar

Mathematical Approaches to Lower Bounds: Complexity of Proofs and Computation Lower bounds for symmetric arithmetic circuits by Anuj Dawar, University of Cambridge

From  Iain Cms 0 likes 12 plays 0  

A lower bound for k-DNF Resolution on random CNFs - Dmitry Sokolov

Mathematical Approaches to Lower Bounds: Complexity of Proofs and Computation A lower bound for k-DNF Resolution on random CNFs by Dmitry Sokolov

From  Iain Cms 0 likes 19 plays 0  

Depth lower bounds in Stabbing Planes - Nicola Galesi

Mathematical Approaches to Lower Bounds: Complexity of Proofs and Computation Depth lower bounds in Stabbing Planes by Nicola Galesi, Sapienza University Rome

From  Iain Cms 0 likes 7 plays 0  

The minimum circuit size problem is hard for sum of squares - Kilian Risse

Mathematical Approaches to Lower Bounds: Complexity of Proofs and Computation The minimum circuit size problem is hard for sum of squares KTH Royal Institute of Technology Kilian Risse

From  Iain Cms 0 likes 11 plays 0  

Learning from equivalence queries and unprovability of circuit upper bounds - Igor Oliveira

Mathematical Approaches to Lower Bounds: Complexity of Proofs and Computation Learning from equivalence queries and unprovability of circuit upper bounds University of Warwick Igor Oliveira

From  Iain Cms 0 likes 17 plays 0  

Survey on meta complexity - Rahul Santhanam

Mathematical Approaches to Lower Bounds: Complexity of Proofs and Computation Survey on meta complexity Oxford University Rahul Santhanam

From  Iain Cms 0 likes 4 plays 0  

Anis Hamadouche Presentation - SSPD 2021

Presented at the Sensor Signal Processing for Defence Conference (SSPD) 2021Presentation: "Approximate Proximal-Gradient Methods" Speaker: Anis Hamadouche, Heriot-Watt…

From  Joe Burchell 0 likes 31 plays 0  

Extremes of stochastic processes: Krzysztof Bisewski

This talk has been automatically captioned. You can remove these by pressing CC on the video toolbar. Name: Krzysztof Bisewski Talk Title: Bounds on the expected supremum of fractional Brownian…

From  Belle Taylor 0 likes 80 plays 0  

Krzysztof Bisewski EVA Talk Preview

This talk has captions. You can remove these by pressing CC on the video toolbar. Name: Krzysztof Bisewski Talk Title: Bounds on the expected supremum of fractional Brownian motion with drift…

From  Anna Munro 0 likes 19 plays 0  

Anna Ben-Hamou EVA Talk Preview

This talk has captions. You can remove these by pressing CC on the video toolbar. Name: Anna Ben-Hamou Talk Title: Non-asymptotic bounds for Probability weighted moment estimators Abstract: In…

From  Anna Munro 0 likes 35 plays 0  

Corina Birghila EVA Talk Preview

This talk has captions. You can remove these by pressing CC on the video toolbar. Name: Corina Birghila Talk Title: Distributionally robust bounds for tail indices Abstract: In this work, we…

From  Anna Munro 0 likes 15 plays 0  

Rafail Kartsioukas EVA Talk Preview

This talk has captions. You can remove these by pressing CC on the video toolbar. Name: Rafail Kartsioukas Talk Title: On the rate of concentration of maxima in Gaussian arrays Abstract: It has…

From  Anna Munro 0 likes 46 plays 0  

LMS Computer Science Colloquium - Anupam Das (Birmingham)

An automated programme is used to generate the subtitles on this talk. You can remove the subtitles by pressing CC on the bottom toolbar. Anupam Das (Birmingham) The size of proofs: from…

From  Liam Holligan 0 likes 18 plays 0