Pseudorandomness and the AdS-CFT Correspondence - Adam Bouland
Explore pseudorandomness in AdS/CFT correspondence, addressing the wormhole growth paradox and its implications for quantum gravity and computational complexity theory.
The Individual's Search for Self-Discovery
Esplorazione del percorso di ricerca personale attraverso citazioni di Shakespeare, Jobs e Schwarzenegger, guidata da un esperto di letteratura inglese e shakespeariana.
Et si on prenait le temps - Réflexions sur notre relation au temps
Réflexion sur l'accélération du temps et ses impacts relationnels, basée sur des recherches en environnements connectés. Exploration de la complexité et de l'interdisciplinarité dans divers domaines.
Abitare l'Incertezza - Navigating Uncertainty in Modern Decision-Making
Esplorazione dei modelli VUCA e BANI per comprendere la complessità delle decisioni nel contesto sociale attuale, offrendo spunti per affrontare l'incertezza della vita moderna.
Multiplayer Parallel Repetition for Three-Player Games on Binary Inputs
Explorez la répétition parallèle dans les jeux multijoueurs, en mettant l'accent sur les jeux à trois joueurs avec entrées binaires. Découvrez les dernières avanc ées et techniques d'analyse.
The Phase Transition Phenomena in Combinatorial Structures
Explore phase transitions in combinatorial structures, from physics-inspired concepts to discrete systems, with rigorous analysis of rapid transformations.
Méthodes Automatiques pour la Génération Aléatoire de Structures - Cours 1
Explorez les méthodes automatiques de génération aléatoire de structures mathématiques dans cette conférence approfondie. Découvrez des techniques avancées pour créer et analyser des structures complexes.
Symbolic Dynamics and Representations of Matrices
Explorez la dynamique symbolique et les représentations matricielles dans cette conférence mathématique approfondie de 50 minutes.
Mestrado: Computação, Lógica e Teoria dos Conjuntos - Aula 01
Explore fundamentos de computação, lógica e teoria dos conjuntos em aula de mestrado. Aborde linguagens formais, máquinas de registro, decidibilidade, complexidade algorítmica e lógica de primeira ordem.
Random Restrictions and Fourier Concentration - Part 2
Explore advanced concepts in Fourier analysis and random restrictions, focusing on their applications in theoretical computer science and mathematical analysis.
Random Restrictions and Fourier Concentration - Part 1
Explore random restrictions and Fourier concentration in analysis and theoretical computer science with MIT researcher Esty Kelman.
New Models of Games with Imperfect Information
Explores innovative approaches to modeling imperfect information in infinite games using finite-state automata, comparing observation-based and indistinguishability-relation models for enhanced expressiveness and strategy synthesis.
Solving Two-Player Games under Progress Assumptions
Explore solving infinite two-player games with progress assumptions in cyber-physical system design. Analyze complexity classes and efficient algorithms for augmented games.
Stable Matchings Beyond Worst-Case Analysis
Explore stable matchings beyond worst-case scenarios with Claire Mathieu's in-depth analysis of mathematical concepts and their applications in economics and computer science.
The Art of Repair - Resnick Aspen Action Forum 2023
Explore the concept of repair in society with philosopher Bayo Akomolafe, delving into innovative approaches to healing and transformation in our interconnected world.
Deciding Asynchronous Hyperproperties for Recursive Programs
Explore a novel logic for asynchronous hyperproperties, enhancing model checking for recursive programs. Gain insights into temporal logic, automata theory, and pushdown systems.
Orthologic with Axioms - Proof Theory and Algorithms
Explore orthologic with axioms, its proof theory, and algorithms. Discover generalized ortholattice reasoning and its applications in verification condition simplification and normalization.
Introductory Lectures on First-Order Convex Optimization - Lecture 1
Explore first-order convex optimization, covering gradient descent, complexity, smoothness, and Nesterov's accelerated algorithm. Gain insights into theoretical foundations and practical applications in machine learning.
Hardness Results in Discrete Morse Theory for 2-Complexes
Explore inapproximability and parameterized complexity in discrete Morse theory for 2-complexes, focusing on minimizing critical simplices and presenting new hardness results and an approximation algorithm.
Graph Algorithms and Graph Theory - Session 1B
Explore advanced concepts in graph algorithms and theory, delving into cutting-edge research and applications presented at FOCS 2020.
Graph Algorithms and Graph Theory - Session 7A
Explore advanced concepts in graph algorithms and theory, delving into cutting-edge research and applications presented at the FOCS 2020 conference.