Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Computational Complexity

Showing: 393 courses
NPTEL

Design & Analysis of Algorithms

1 rewiews
Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.
Add to list
34 Lesons
1 day 6 hours
On-Demand
Free-Video
Association for Computing Machinery (ACM)

KDD 2020: Physics Inspired Models in Artificial Intelligence

1 rewiews
Explore the intersection of physics and AI, covering paradigms, generalization, complexity, interpretability, and physics-informed neural networks. Gain insights into the synergy between these fields.
Add to list
31 Lesons
1 hour 21 minutes
On-Demand
Free-Video
Harvard University

CS50 2012 - Week 3 Continued: Search Algorithms and Sorting Techniques

0 rewiews
Explore efficient search and sorting algorithms, including linear and binary search, bubble sort, selection sort, and merge sort. Learn asymptotic notation for algorithm analysis.
Add to list
11 Lesons
1 hour 5 minutes
On-Demand
Free-Video
Stanford University

Stanford Lecture - Don Knuth - "A Conjecture That Had To Be True"

0 rewiews
Donald Knuth explores a fascinating problem in combinatorial geometry, presenting an intriguing formula and its unexpected universal application, showcasing the beauty of mathematical discovery.
Add to list
1 Lesons
1 hour 7 minutes
On-Demand
Free-Video
Stanford University

The Analysis of Algorithms - 2015 Recreation of 1969 Lecture

0 rewiews
Explore the foundations of algorithm analysis with legendary computer scientist Donald Knuth as he recreates his inaugural Stanford lecture from 1969.
Add to list
1 Lesons
54 minutes
On-Demand
Free-Video
Broad Institute

The Challenges of Training Infinitely Large Neural Networks

0 rewiews
Explore challenges in training infinitely large neural networks with Mikhail Belkin. Gain insights into foundational advances in machine learning for biomedical applications.
Add to list
1 Lesons
1 hour 6 minutes
On-Demand
Free-Video
Neso Academy

Space Complexity of Recursive Algorithms - Solved Problem 2

0 rewiews
Analyze space complexity of recursive algorithms through a solved problem, enhancing understanding of memory usage in algorithmic design.
Add to list
1 Lesons
12 minutes
On-Demand
Free-Video
Simons Institute

Iterated Models: Expressive Power, Learning, and Chain of Thought

0 rewiews
Explore sequence-to-sequence models, focusing on transformers, their computational power, and learning complexities. Gain insights into iterated functions and chain of thought.
Add to list
1 Lesons
54 minutes
On-Demand
Free-Video
Simons Institute

Transformers, Parallel Computation, and Logarithmic Depth

0 rewiews
Explore the computational power of transformers, their connection to parallel processing, and efficiency in solving complex tasks with logarithmic depth.
Add to list
1 Lesons
57 minutes
On-Demand
Free-Video
Institute for Advanced Study

Reading Alan Turing - Exploring Turing's Influential Ideas in Theoretical Computer Science

0 rewiews
Explore Turing's influential papers and their impact on theoretical computer science with Avi Wigderson. Gain insights into Turing's visionary ideas and their modern relevance.
Add to list
1 Lesons
1 hour 11 minutes
On-Demand
Free-Video
Serrano.Academy

The Fast Fourier Transform - Efficient Algorithm for Signal Processing

0 rewiews
Dive into the Fast Fourier Transform, exploring its efficiency over the Discrete Fourier Transform and understanding the crucial Butterfly algorithm in signal processing.
Add to list
4 Lesons
17 minutes
On-Demand
Free-Video
ICTP-SAIFR

Prospects and Challenges for Quantum Machine Learning - Class 2

0 rewiews
Explore prospects and challenges of quantum machine learning with Marco Cerezo, delving into advanced concepts and potential applications in this comprehensive lecture.
Add to list
1 Lesons
1 hour 26 minutes
On-Demand
Free-Video
ICTP-SAIFR

Prospects and Challenges for Quantum Machine Learning - Class 1

0 rewiews
Explore the potential and obstacles of quantum machine learning with Marco Cerezo, delving into cutting-edge research and applications in this emerging field.
Add to list
1 Lesons
1 hour 24 minutes
On-Demand
Free-Video
Simons Institute

When Do Dependencies in Your Data Help? - Emerging Generalization Settings

0 rewiews
Explore how dependencies in data can overcome computational barriers in learning graphical models, using the Glauber dynamics process as a natural data generation method.
Add to list
1 Lesons
59 minutes
On-Demand
Free-Video
ICTP-SAIFR

Prospects and Challenges for Quantum Machine Learning - Class 3

0 rewiews
Explore prospects and challenges of quantum machine learning with Marco Cerezo, delving into cutting-edge research and potential applications in this advanced lecture.
Add to list
1 Lesons
1 hour 26 minutes
On-Demand
Free-Video
INSAIT Institute

Self-Adjusting Data Structures - Designing for Efficient Operation Sequences

0 rewiews
Explore self-adjusting data structures with Prof. Robert Tarjan. Learn about adaptive designs that optimize total operational costs, enhancing efficiency in various computational scenarios.
Add to list
1 Lesons
1 hour 13 minutes
On-Demand
Free-Video
The Julia Programming Language

Understanding the Discrete Fourier Transform - Week 14

0 rewiews
Explore Discrete Fourier Transform using Julia, from basic concepts to implementation. Compare DFT with Fast Fourier Transform, analyze sounds, and understand computational complexity.
Add to list
32 Lesons
35 minutes
On-Demand
Free-Video
Simons Institute

Edit Distance Robust Watermarks - Beyond Substitution Channels in Language Models

0 rewiews
Delve into advanced watermarking techniques for language models, focusing on robust detection methods that withstand text modifications while maintaining cryptographic undetectability.
Add to list
1 Lesons
47 minutes
On-Demand
Free-Video
Simons Institute

Self-Proving Models: Learning Algorithms with Interactive Proof Systems

0 rewiews
Explore self-proving models and interactive proof systems for ensuring AI output correctness, focusing on algorithms, learning complexity, and practical applications in computational tasks.
Add to list
1 Lesons
45 minutes
On-Demand
Free-Video
TEDx

Complessità e Disordine - Dal Premio Nobel al Machine Learning

0 rewiews
Esplorazione del legame tra la teoria dei sistemi disordinati di Parisi e le sfide del Machine Learning, evidenziando come la complessità influenzi l'ottimizzazione dei sistemi.
Add to list
1 Lesons
17 minutes
On-Demand
Free-Video
Banach Center

Complexity of Approximating Holder Classes from Information with Varying Gaussian Noise

0 rewiews
Explore approximation complexity for Holder classes with varying Gaussian noise, focusing on mathematical applications and information theory concepts.
Add to list
1 Lesons
35 minutes
On-Demand
Free-Video
Centre de recherches mathématiques - CRM

Machine Learning for Computing Tensor Rank

0 rewiews
Explorez l'utilisation de l'apprentissage par renforcement pour découvrir de nouveaux algorithmes de multiplication matricielle et calculer le rang des tenseurs.
Add to list
32 Lesons
1 hour
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Et si SAT était vraiment difficile? Quelques conséquences des hypothèses ETH - Lecture

0 rewiews
Explorez les implications des hypothèses ETH sur la difficulté du problème SAT et ses conséquences en informatique théorique et complexité algorithmique.
Add to list
1 Lesons
58 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

A Quick and Partial Survey on the Complexity of Query Answering

0 rewiews
Explore the complexity of query answering in this survey, covering key concepts and recent developments in discrete mathematics and logic.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Regularization via Permutation of Labels - Lecture 1

0 rewiews
Explore regularization techniques using label permutation in mathematical statistics, focusing on innovative approaches and their applications.
Add to list
1 Lesons
52 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Regularization via Permutation of Labels - Lecture 2

0 rewiews
Explore advanced statistical techniques for regularization through label permutation, focusing on mathematical theory and practical applications.
Add to list
1 Lesons
43 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Algebraic Attacks for the Rank Decoding Problem - Lecture 2

0 rewiews
Explorez les attaques algébriques pour le problème du décodage de rang dans cette conférence mathématique approfondie, axée sur les avancées récentes et les techniques avancées.
Add to list
1 Lesons
1 hour 23 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Algebraic Attacks for the Rank Decoding Problem - Lecture 1

0 rewiews
Explorez les attaques algébriques pour le problème du décodage de rang dans cette conférence mathématique approfondie, mettant l'accent sur les concepts clés et les techniques avancées.
Add to list
1 Lesons
1 hour 37 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Randomness and Complexity - Lecture 2

0 rewiews
Explore connections between randomness and complexity in mathematics, focusing on advanced concepts and their applications in discrete mathematics and computer science.
Add to list
1 Lesons
1 hour 26 minutes
On-Demand
Free-Video
Instituto de Matemática Pura e Aplicada

Mestrado: Computação, Lógica e Teoria dos Conjuntos - Aula 04

0 rewiews
Explore conceitos avançados de computação teórica, incluindo linguagens formais, máquinas de registro, decidibilidade e complexidade algorítmica. Aprofunde-se em lógica de primeira ordem e teoria dos conjuntos.
Add to list
17 Lesons
1 hour 34 minutes
On-Demand
Free-Video
IEEE

Nearly Sample Optimal Sparse Fourier Transform in Any Dimension - RIPless and Filterless

0 rewiews
Explore advanced techniques for sparse Fourier transforms in multidimensional spaces, focusing on sample-optimal methods without relying on RIP or filtering.
Add to list
1 Lesons
18 minutes
On-Demand
Free-Video
Math TAU

Zero-Sum Structure of Nash Equilibria Sets in Finite Games - Applications to Game Theory Decision Problems

0 rewiews
Explore zero-sum structures in Nash equilibria sets of finite games and their implications for complexity in game theory decision problems.
Add to list
1 Lesons
1 hour 4 minutes
On-Demand
Free-Video
Simons Institute

Deciding Regular Games - A Playground for Exponential Time Algorithms

0 rewiews
Explore exponential time algorithms for deciding regular games, examining their applications and implications in system design and analysis.
Add to list
1 Lesons
41 minutes
On-Demand
Free-Video
Simons Institute

Computing a Fixed Point of Contraction Maps in Polynomial Queries

0 rewiews
Efficient algorithm for computing fixed points of contraction maps, with potential implications for solving simple stochastic games and related computational problems.
Add to list
1 Lesons
37 minutes
On-Demand
Free-Video
ANITI Toulouse

Equilibria of Games with Algorithms

0 rewiews
Explore game theory equilibria involving algorithms, focusing on strategic interactions and decision-making processes in computational settings.
Add to list
1 Lesons
26 minutes
On-Demand
Free-Video
Inside Livermore Lab

Reduced Order Modeling for Finite Element Simulations with MFEM and libROM

0 rewiews
Explore reduced order modeling techniques for finite element simulations using MFEM and libROM. Learn to lower computational complexity while maintaining accuracy in various scientific applications.
Add to list
8 Lesons
20 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

Graph Alignment: Informational and Computational Limits - Lecture 1

0 rewiews
Explore graph alignment challenges, focusing on informational and computational limits in data science. Gain insights into probabilistic methods for analyzing complex network structures.
Add to list
1 Lesons
1 hour
On-Demand
Free-Video
Applied Algebraic Topology Network

Bounding the Interleaving Distance for Mapper Graphs with a Loss Function

0 rewiews
Exploring interleaving distance for Mapper graphs, introducing a loss function to measure assignment quality and enable polynomial-time computation for data comparison and clustering.
Add to list
1 Lesons
57 minutes
On-Demand
Free-Video
Simons Institute

Algebraic Structures in Logic and Query Evaluation - Lecture 3

0 rewiews
Explore algebraic structures in logic and query evaluation, focusing on advanced concepts and their applications in database theory and AI.
Add to list
1 Lesons
1 hour 2 minutes
On-Demand
Free-Video
Simons Institute

Verifiable Data Science via Interactive Proofs

0 rewiews
Explore interactive proofs for verifiable data science, enhancing trust and reliability in scientific computations and analyses.
Add to list
1 Lesons
1 hour 7 minutes
On-Demand
Free-Video
Simons Institute

Approximate Message Passing Algorithms

0 rewiews
Explore Approximate Message Passing algorithms, their applications in statistical inference, and theoretical foundations including state evolution, convergence, and joint distribution analysis.
Add to list
13 Lesons
1 hour 7 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Constant Girth Approximation for Directed Graphs in Subquadratic Time

0 rewiews
Explore subquadratic-time algorithms for approximating constant girth in directed graphs, covering ball growing techniques, random sampling, and combined approaches for efficient graph analysis.
Add to list
10 Lesons
22 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Fast FPT-Approximation of Branchwidth

0 rewiews
Explore efficient graph decomposition techniques and FPT algorithms for approximating branchwidth, with applications in structural graph theory and dynamic programming.
Add to list
8 Lesons
32 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

David Cerna: Proof Schema and the Refutational Complexity of Their Cut Structure

0 rewiews
Explore proof schemas, refutational complexity, and cut structures in mathematical logic. Gain insights into CERES, ECA, and 1-SMA concepts for advanced theorem proving techniques.
Add to list
14 Lesons
39 minutes
On-Demand
Free-Video
Applied Algebraic Topology Network

Computing Optimal Homotopies

0 rewiews
Explore optimal curve similarity measures using homotopy-based approaches, examining structural properties, algorithms, and open questions in topology and computational geometry.
Add to list
20 Lesons
47 minutes
On-Demand
Free-Video
Fields Institute

Nonlinear Reduced Models for Parametric/Random PDEs

0 rewiews
Explore efficient techniques for constructing reduced models of parametric/random PDEs, focusing on error estimation, library construction, and practical applications in thermal systems and state estimation.
Add to list
18 Lesons
41 minutes
On-Demand
Free-Video
Applied Algebraic Topology Network

RipsNet- Fast and Robust Estimation of Persistent Homology for Point Clouds

0 rewiews
Estimating persistence diagrams of point clouds using neural networks for faster, more robust topological analysis. Overcomes computational complexity and sensitivity to outliers in practical applications.
Add to list
1 Lesons
54 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

Graph Alignment: Informational and Computational Limits - Lecture 2

0 rewiews
Explore graph alignment challenges, focusing on informational and computational limits. Gain insights into probabilistic and optimization methods for data science applications.
Add to list
1 Lesons
1 hour 9 minutes
On-Demand
Free-Video
Simons Institute

Optimization: First-order Methods - Part 2

0 rewiews
Explore advanced first-order optimization techniques, focusing on accelerated gradient methods and their applications in solving complex algorithmic problems.
Add to list
1 Lesons
1 hour 5 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

Alignment of Random Graphs: Informational and Computational Limits - Lecture 2

0 rewiews
Explores informational and computational limits in aligning random graphs, focusing on advanced probabilistic techniques for data science and graph theory applications.
Add to list
1 Lesons
1 hour 2 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

Alignment of Random Graphs: Informational and Computational Limits - Lecture 1

0 rewiews
Explore informational and computational limits of random graph alignment in this lecture by Laurent Massoulié, part of a data science discussion on probabilistic and optimization methods.
Add to list
1 Lesons
48 minutes
On-Demand
Free-Video
Simons Institute

Structure of Communication - Richard M. Karp Distinguished Lecture

0 rewiews
Explore communication complexity, its applications, and structural conjectures in theoretical computer science with Shachar Lovett. Gain insights into efficient communication and its connections to various mathematical domains.
Add to list
1 Lesons
1 hour
On-Demand
Free-Video
Joint Mathematics Meetings

Sunflowers: From Soil to Oil

0 rewiews
Explore the mathematical concept of sunflowers, from foundational principles to advanced applications, in this engaging lecture by Anup Rao at the Joint Mathematics Meetings.
Add to list
1 Lesons
52 minutes
On-Demand
Free-Video
IEEE

Graph Algorithms and Coding - Session 5C

0 rewiews
Explore advanced graph algorithms and coding techniques in this IEEE session, focusing on cutting-edge research and practical applications in computer science.
Add to list
1 Lesons
1 hour 32 minutes
On-Demand
Free-Video
IEEE

Counting Small Induced Subgraphs Satisfying Monotone Properties

0 rewiews
Explore techniques for enumerating small induced subgraphs with specific properties, focusing on algorithmic approaches and complexity analysis in graph theory.
Add to list
1 Lesons
21 minutes
On-Demand
Free-Video
IEEE

The Complexity of 3-Colouring H-Colourable Graphs

0 rewiews
Explore the intricacies of graph theory, focusing on 3-colouring H-colourable graphs and their computational complexity. Gain insights into advanced mathematical concepts and algorithmic challenges.
Add to list
1 Lesons
21 minutes
On-Demand
Free-Video
IEEE

On the Existence of Algebraically Natural Proofs

0 rewiews
Explore the concept of algebraically natural proofs in mathematics, examining their existence and implications for computational complexity theory.
Add to list
1 Lesons
23 minutes
On-Demand
Free-Video
IEEE

Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems

0 rewiews
Explore multi-pass graph streaming lower bounds for cycle counting, MAX-CUT, matching size, and related problems in this advanced computer science presentation.
Add to list
1 Lesons
21 minutes
On-Demand
Free-Video
IEEE

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

0 rewiews
Explore near-quadratic lower bounds for two-pass graph streaming algorithms, covering streaming models, graph problems, and Ruzsa-Szemeredi graphs.
Add to list
16 Lesons
25 minutes
On-Demand
Free-Video
Insights into Mathematics

Unique Factorization and Its Difficulties - Data Structures Math Foundations 199

0 rewiews
Exploring unique factorization, its challenges with large numbers, and modern factoring techniques. Discusses implications for internet security and computational complexity.
Add to list
5 Lesons
28 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Solving Overparametrized Systems of Nonlinear Equations

0 rewiews
Explore overparametrized nonlinear equation systems, their solutions, and implications for neural network optimization landscapes with Stanford's Andrea Montanari at IPAM's EnCORE Workshop.
Add to list
1 Lesons
58 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

How Hard is it to Solve This? - Computational Complexity in Problem Solving

0 rewiews
Explore problem-solving techniques in mathematics and statistics through lectures, hands-on sessions, and interactions with distinguished researchers. Gain broader exposure to key topics and enhance analytical skills.
Add to list
1 Lesons
44 minutes
On-Demand
Free-Video
Simons Institute

Graph Coloring Through the Sublinear Lens

0 rewiews
Explore sublinear algorithms for graph coloring, examining innovative approaches and their applications in computational efficiency and problem-solving in graph theory.
Add to list
1 Lesons
1 hour 3 minutes
On-Demand
Free-Video
Simons Institute

Property Testing for Graphs

0 rewiews
Explore advanced techniques in property testing for graphs, focusing on sublinear algorithms and their applications in large-scale network analysis.
Add to list
1 Lesons
1 hour 23 minutes
On-Demand
Free-Video
Fields Institute

Forbidding Induced Subgraphs - Structure and Algorithms

0 rewiews
Explore graph theory with Maria Chudnovsky, focusing on forbidden induced subgraphs and their impact on graph structure and algorithmic applications.
Add to list
1 Lesons
38 minutes
On-Demand
Free-Video
MUNI Seminar Series

Expanders in Higher Dimensions: From Local to Global Properties and Applications

0 rewiews
Explore high-dimensional expanders, their local-to-global properties, and applications in coding theory, networking, and computational complexity.
Add to list
18 Lesons
39 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Designing and Exploiting Fast Algorithms for Polynomial Matrices - Lecture 2

0 rewiews
Explorez les algorithmes rapides pour les matrices polynomiales et leurs applications dans cette conférence approfondie sur l'algèbre informatique.
Add to list
1 Lesons
1 hour 28 minutes
On-Demand
Free-Video
Institute for Advanced Study

Recent Advances in Dynamic Graph Algorithms

0 rewiews
Explore recent advancements in dynamic graph algorithms, focusing on efficient data structures and techniques for handling evolving network structures.
Add to list
1 Lesons
14 minutes
On-Demand
Free-Video
Institute for Advanced Study

Expanders and Property Testing

0 rewiews
Explore expanders and property testing in graph theory, focusing on their applications and connections to theoretical computer science.
Add to list
1 Lesons
19 minutes
On-Demand
Free-Video
Simons Institute

Sparsifying Set Systems for Coverage Problems

0 rewiews
Explore recent advancements in sparsifying set systems for coverage problems, focusing on sublinear graph simplification techniques.
Add to list
1 Lesons
35 minutes
On-Demand
Free-Video
Simons Institute

Approximating Maximum Matching Requires Almost Quadratic Time

0 rewiews
Explore algorithms for estimating maximum matching size, focusing on recent advancements and lower bounds. Gain insights into subquadratic time complexity and its limitations in graph theory.
Add to list
1 Lesons
24 minutes
On-Demand
Free-Video
Simons Institute

On (1 + ε)-Approximate (Vertex) Cut Sparsifiers

0 rewiews
Explore advanced graph compression techniques for planar and quasi-bipartite graphs, focusing on high-quality cut sparsifiers and their size bounds. Analyze contraction-based approaches and their limitations.
Add to list
1 Lesons
29 minutes
On-Demand
Free-Video
Simons Institute

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs

0 rewiews
Explore advanced algorithms for dynamic maximum matching using Ordered Ruzsa-Szemeredi Graphs, improving update time to n^{o(1)} * ORS(n) and reducing the problem to a combinatorial bound.
Add to list
1 Lesons
44 minutes
On-Demand
Free-Video
Simons Institute

Planar Partition Oracles for Bounded Degree Graphs in Polynomial Time

0 rewiews
Explore planar graph partition oracles for bounded degree graphs, focusing on hyperfinite decompositions and their applications in sublinear algorithms and property testing.
Add to list
1 Lesons
34 minutes
On-Demand
Free-Video
Simons Institute

Conditional Sampling for Distribution Testing

0 rewiews
Explore conditional sampling techniques for distribution testing, focusing on efficient algorithms and their applications in statistical analysis.
Add to list
1 Lesons
10 minutes
On-Demand
Free-Video
Simons Institute

Toward Optimal Semi-streaming Algorithm for (1+ε)-Approximate Maximum Matching

0 rewiews
Explore a deterministic algorithm for (1+ε)-approximate maximum matching, improving pass-complexity and advancing solutions in various computational models.
Add to list
1 Lesons
31 minutes
On-Demand
Free-Video
Simons Institute

Low Degree Testing over the Reals

0 rewiews
Explore low degree testing over real numbers, focusing on theoretical concepts and applications in local algorithms.
Add to list
1 Lesons
33 minutes
On-Demand
Free-Video
Simons Institute

Subgraph Counting and Seed Counting in Graph Theory

0 rewiews
Explore sublinear subgraph counting and sampling techniques, focusing on the advantages of counting seeds in graph analysis.
Add to list
1 Lesons
41 minutes
On-Demand
Free-Video
Simons Institute

Maximal Matching in Bounded-deletion Streams

0 rewiews
Explore maximal matching in bounded-deletion graph streams, analyzing space complexity as a function of deletion parameter K. Gain insights into algorithmic techniques and lower bound results.
Add to list
1 Lesons
38 minutes
On-Demand
Free-Video
Simons Institute

Graphs with Large Edge Weights for Shortest Path Structure - Sublinear Graph Simplification

0 rewiews
Explore the relationship between graph shortest paths and edge weight ratios, examining reweighting techniques to preserve path structures.
Add to list
1 Lesons
32 minutes
On-Demand
Free-Video
Institute for Advanced Study

The Mysterious Kronecker Coefficients in Algebraic Combinatorics

0 rewiews
Explore the enigmatic Kronecker coefficients, their significance in algebraic combinatorics, and recent developments in positivity, asymptotics, and computational complexity.
Add to list
1 Lesons
1 hour 11 minutes
On-Demand
Free-Video
Centre de recherches mathématiques - CRM

Polynomial-Time Power-Sum Decomposition of Polynomials - Efficient Algorithms and Applications

0 rewiews
Explore efficient algorithms for power-sum decomposition of polynomials, improving on prior work for tensor decomposition and Gaussian mixture identifiability. Gain insights into numerical linear algebra and noise-resilient techniques.
Add to list
18 Lesons
51 minutes
On-Demand
Free-Video
BIMSA

Around the Alexandrov-Fenchel Inequality - Convex Geometry and Its Applications

0 rewiews
Explore the history and recent progress in convex geometry, focusing on Minkowski's theory and its connections to various mathematical disciplines.
Add to list
1 Lesons
54 minutes
On-Demand
Free-Video
BIMSA

Hypertrees in Combinatorics and Graph Theory

0 rewiews
Explore hypertrees with Professor Nati Linial, delving into combinatorics, algorithms, and their applications in computer science and mathematics.
Add to list
1 Lesons
1 hour
On-Demand
Free-Video
Georgia Tech Research

Combinatorial Testing Problems - Lecture 1

0 rewiews
Explore combinatorial testing problems, including hidden clique and high-dimensional random geometric graphs, with insights on statistical challenges and estimation techniques.
Add to list
1 Lesons
52 minutes
On-Demand
Free-Video
BIMSA

Knot Invariants from Finite Dimensional Integration

0 rewiews
Explore finite dimensional integration for computing powerful knot invariants, surpassing traditional methods in efficiency and rigor while challenging established notions in knot theory.
Add to list
1 Lesons
1 hour 11 minutes
On-Demand
Free-Video
GeeCON Conference

The Tale of Math and Scalability - Predicting System Performance

0 rewiews
Explore how mathematical principles can predict and enhance software system scalability, uncovering the hidden math behind efficient engineering practices.
Add to list
1 Lesons
23 minutes
On-Demand
Free-Video
Institute for Advanced Study

Combinatorial Inequalities and Combinatorial Interpretations - Part I

0 rewiews
Explore classical inequalities in enumerative and algebraic combinatorics, their combinatorial interpretations, and their impact on the field. Gain insights into complexity theoretic aspects.
Add to list
1 Lesons
1 hour 13 minutes
On-Demand
Free-Video
Finnish Center for Artificial Intelligence FCAI

Bayesian Inference of Causal Graphs: Current Status and Future Directions

0 rewiews
Explore Bayesian inference for causal discovery, examining recent progress, challenges, and assumptions in modeling cause-effect relationships from observational data.
Add to list
1 Lesons
48 minutes
On-Demand
Free-Video
Instituto de Matemática Pura e Aplicada

The Number of Random 2-SAT Solutions is Asymptotically Log-Normal

0 rewiews
Explore discrete probability and statistics in a month-long program featuring talks, minicourses, and collaborative sessions. Engage with researchers and delve into topics like random 2-SAT solutions.
Add to list
1 Lesons
47 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Entanglement Subvolume Law for 2D Frustration-Free Spin Systems

0 rewiews
Explore entanglement entropy in 2D frustration-free spin systems, examining Hastings' proof, robust polynomials, and the Whole Screen Directivity Lemma.
Add to list
15 Lesons
23 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Matrix Product States for Modeling Dynamical Processes on Networks

0 rewiews
Explore matrix product states and dynamic message-passing algorithms for modeling network dynamics, reducing computational complexity from exponential to polynomial in system size and duration.
Add to list
1 Lesons
39 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

Why Do Simple Models Work? Partial Answers from Information Geometry - Lecture 1

0 rewiews
Explores information geometry to understand why simple models effectively describe complex systems, focusing on statistical mechanics, renormalization, and model reduction in physics and biology.
Add to list
20 Lesons
1 hour 33 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Local Weak Convergence for Random Constraint Satisfaction Problems

0 rewiews
Explore local weak convergence in random constraint satisfaction problems with Princeton's Allan Sly, delving into advanced statistical mechanics concepts beyond two dimensions.
Add to list
1 Lesons
46 minutes
On-Demand
Free-Video
Simons Institute

Pseudorandomness and Pseudoentanglement in Holography

0 rewiews
Explores the intersection of quantum complexity and holography, discussing pseudo-entangled states and their implications for quantum gravity and computational capabilities in AdS/CFT correspondence.
Add to list
1 Lesons
1 hour 7 minutes
On-Demand
Free-Video
Simons Institute

Holographic Pseudo Entropy and Emergent Spacetime

0 rewiews
Explore holographic pseudo entropy, its gravity dual, and implications for emergent spacetime in string theory. Gain insights into AdS/CFT, computational complexity, and quantum entanglement.
Add to list
1 Lesons
51 minutes
On-Demand
Free-Video
Simons Institute

Local Minima in Quantum Systems

0 rewiews
Explores computational challenges in finding local energy minima of quantum systems, comparing classical and quantum approaches and their implications for understanding Nature's cooling processes.
Add to list
1 Lesons
46 minutes
On-Demand
Free-Video
Simons Institute

How Quantum Complexity Found Its Way into Black Hole Physics

0 rewiews
Explore the surprising connection between quantum complexity and black hole physics, uncovering new insights into horizon properties and the quantum extended Church Turing Thesis.
Add to list
1 Lesons
1 hour 12 minutes
On-Demand
Free-Video
QuICS

Quantum Spin Chains and Symmetric Functions: Connections to Representation Theory and Combinatorics

0 rewiews
Explore quantum spin chains' connections to representation theory, combinatorics, and algebraic geometry through quantum integrability and symmetric functions.
Add to list
1 Lesons
59 minutes
On-Demand
Free-Video
Institute for Advanced Study

When and How are Promise Constraint Satisfaction Problems Efficiently Solvable

0 rewiews
Delve into the mathematical foundations of Constraint Satisfaction Problems (CSP), exploring algorithmic efficiency, polymorphisms, and promise CSP applications in graph coloring and discrepancy minimization.
Add to list
1 Lesons
1 hour 5 minutes
On-Demand
Free-Video