Escaping the curse of dimensionality in combinatorics
published: July 6, 2021, recorded: July 2021, views: 4
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
We discuss some notoriously hard combinatorial problems for large classes of graphs and hypergraphs arising in geometric, algebraic, and practical applications. These structures escape the “curse of dimensionality”: they can be embedded in a bounded-dimensional space, or they have small VCdimension or a short algebraic description. What are the advantages of low dimensionality?
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !