Machine Learning for Computing Tensor Rank
Explorez l'utilisation de l'apprentissage par renforcement pour découvrir de nouveaux algorithmes de multiplication matricielle et calculer le rang des tenseurs.
Et si SAT était vraiment difficile? Quelques conséquences des hypothèses ETH - Lecture
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.
A Quick and Partial Survey on the Complexity of Query Answering
Explore the complexity of query answering in this survey, covering key concepts and recent developments in discrete mathematics and logic.
Regularization via Permutation of Labels - Lecture 1
Explore regularization techniques using label permutation in mathematical statistics, focusing on innovative approaches and their applications.
Regularization via Permutation of Labels - Lecture 2
Explore advanced statistical techniques for regularization through label permutation, focusing on mathematical theory and practical applications.
Algebraic Attacks for the Rank Decoding Problem - Lecture 2
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.
Algebraic Attacks for the Rank Decoding Problem - Lecture 1
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.
Randomness and Complexity - Lecture 2
Explore connections between randomness and complexity in mathematics, focusing on advanced concepts and their applications in discrete mathematics and computer science.
Mestrado: Computação, Lógica e Teoria dos Conjuntos - Aula 04
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.
Nearly Sample Optimal Sparse Fourier Transform in Any Dimension - RIPless and Filterless
Explore advanced techniques for sparse Fourier transforms in multidimensional spaces, focusing on sample-optimal methods without relying on RIP or filtering.
Zero-Sum Structure of Nash Equilibria Sets in Finite Games - Applications to Game Theory Decision Problems
Explore zero-sum structures in Nash equilibria sets of finite games and their implications for complexity in game theory decision problems.
Deciding Regular Games - A Playground for Exponential Time Algorithms
Explore exponential time algorithms for deciding regular games, examining their applications and implications in system design and analysis.
Computing a Fixed Point of Contraction Maps in Polynomial Queries
Efficient algorithm for computing fixed points of contraction maps, with potential implications for solving simple stochastic games and related computational problems.
Equilibria of Games with Algorithms
Explore game theory equilibria involving algorithms, focusing on strategic interactions and decision-making processes in computational settings.
Reduced Order Modeling for Finite Element Simulations with MFEM and libROM
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.
Graph Alignment: Informational and Computational Limits - Lecture 1
Explore graph alignment challenges, focusing on informational and computational limits in data science. Gain insights into probabilistic methods for analyzing complex network structures.
Bounding the Interleaving Distance for Mapper Graphs with a Loss Function
Exploring interleaving distance for Mapper graphs, introducing a loss function to measure assignment quality and enable polynomial-time computation for data comparison and clustering.
Algebraic Structures in Logic and Query Evaluation - Lecture 3
Explore algebraic structures in logic and query evaluation, focusing on advanced concepts and their applications in database theory and AI.
Verifiable Data Science via Interactive Proofs
Explore interactive proofs for verifiable data science, enhancing trust and reliability in scientific computations and analyses.
Approximate Message Passing Algorithms
Explore Approximate Message Passing algorithms, their applications in statistical inference, and theoretical foundations including state evolution, convergence, and joint distribution analysis.
Constant Girth Approximation for Directed Graphs in Subquadratic Time
Explore subquadratic-time algorithms for approximating constant girth in directed graphs, covering ball growing techniques, random sampling, and combined approaches for efficient graph analysis.