Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings... - Nima Anari

preview_player
Показать описание
Computer Science/Discrete Mathematics Seminar I

Topic: Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings and More
Speaker: Nima Anari
Affiliation: Stanford University
Date: October 26, 2020

  1. Institute for Advanced Study
Рекомендации по теме
Fractionally Log-Concave and 1:04:44

Fractionally Log-Concave and Sector-Stable Polynomials by Nima Anari

Fractionally Log-Concave and 1:16:03

Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings... - Nima Anari

STOC 2021 - 0:15:44

STOC 2021 - Fractionally Log-Concave & Sector-Stable Polynomials: Counting Planar Matchings and ...

Discrete Optimization using 0:48:51

Discrete Optimization using Log-Concave Polynomials

Isotropy and Log-Concave 0:20:12

Isotropy and Log-Concave Polynomials

Counting and Optimization 1:06:43

Counting and Optimization Using Stable Polynomials

Completely Log-Concave Polynomials 0:39:48

Completely Log-Concave Polynomials and Distributions, Part II - B

Nima Anari, A 1:06:31

Nima Anari, A survey on Log-Concave Polynomials and Counting Bases of a Matroid

Log-concave Polynomials and 0:59:56

Log-concave Polynomials and Spectral Independence 2

Local theory for 0:32:27

Local theory for stable polynomials with app to integrability for rational functions of variables

TCS+ talk: Shayan 1:28:49

TCS+ talk: Shayan Oveis Gharan

The Polynomial Paradigm 0:56:13

The Polynomial Paradigm in Algorithms

A Geometric Approach 0:25:37

A Geometric Approach to Conic Stability of Polynomials

Convolutions of Real 0:36:12

Convolutions of Real Stable Polynomials and Root Bounds

Stable polynomial 0:02:47

Stable polynomial

Real Stable Polynomials, 1:02:46

Real Stable Polynomials, Strongly Rayleigh Distributions, and Applications, Part II - A

Determinantal Representations and 0:38:30

Determinantal Representations and the Principal Minor Map

Sampling Arborescences in 0:25:59

Sampling Arborescences in Parallel

Approximate Deterministic Counting 0:51:21

Approximate Deterministic Counting via Marginal Entropy Optimization

Beating the Folklore 0:22:39

Beating the Folklore Algorithm for Dynamic Matching

Last Day of 0:00:52

Last Day of Exams at IIT Delhi 😫🔥🥳 #minivlog #short #iit #collegelife

Tamasha Dekho 😂 0:00:13

Tamasha Dekho 😂 IITian Rocks Relatives Shock 😂😂😂 #JEEShorts #JEE #Shorts

Log-concave sampling: Metropolis-Hastings 0:10:49

Log-concave sampling: Metropolis-Hastings algorithms are fast!

Parallel Discrete Sampling 0:57:10

Parallel Discrete Sampling via Continuous Walks