The Need for Trees: Hierarchies in Urban Systems - Lecture
Explore hierarchies in urban systems and their impact on complex city structures through an interdisciplinary lens of physics and social sciences.
Intelligence at the Edge of Chaos - Understanding Complex Reasoning in Overparameterized LLMs
Explore groundbreaking research on how intelligence emerges in LLMs through complex datasets, focusing on the critical balance between order and chaos in cellular automata-based training.
An SU(2)-symmetric Semidefinite Programming Hierarchy for Quantum Max Cut
Explore advanced quantum physics through SU(2)-symmetric semidefinite programming hierarchies, focusing on Quantum Max Cut problem and its applications in approximating extremal energy states of local Hamiltonians.
Optimization, Complexity and Math - Can We Prove P!=NP by Gradient Descent?
Explore optimization, complexity, and mathematics with Avi Wigderson. Delve into perfect matchings, symbolic matrices, and operator scaling, connecting diverse areas of mathematics and computer science.
Optimization: Interior Point Methods - Part 2
Explore advanced interior point methods for optimization, focusing on data structures and algorithms to enhance computational efficiency in solving complex problems.
A Complexity Theory for the Quantum Age?
Explore quantum complexity theory, entanglement, and the Black Hole Information Paradox in this talk on advancing computational models for the quantum era.
Shafi Goldwasser: Journey from Israel to Turing Award - A Life in Computer Science
Explore Shafi Goldwasser's journey from childhood in Israel to becoming a pioneering computer scientist, covering her education, influences, and experiences that shaped her career.
Stream Ciphers
Explore stream ciphers, including construction, complexity, and recent advancements in cryptographic techniques for data protection and security.
Alan Turing and the Other Theory of Computing and Can a Machine Be Conscious?
Explore Turing's lesser-known 1948 paper on numerical computation and its impact on complexity theory. Discover how it unifies two major traditions in computational theory.
Why AI is Harder Than We Think
Explore AI's challenges and misconceptions with Melanie Mitchell, delving into fallacies, overconfident predictions, and the complexities of intelligence. Gain insights on creating more robust, general, and adaptable AI systems.
Complexity Theory III
Explore advanced complexity theory concepts, including minimal circuits, probabilistic formulas, and explicit obstructions in this in-depth theoretical computer science lecture.
Complexity I
Explore multiplicity theorem, programsized complexity, and algorithmic questions in this deep dive into computational complexity theory and its applications.
Unexpected Hardness Results for Kolmogorov Complexity Under Uniform Reductions
Explore unexpected findings on Kolmogorov complexity, including hardness results, limits, conjectures, and implications for pseudorandom generators and computational complexity.
Min-Max Optimization - Part III
Explore advanced min-max optimization concepts, applications, and theoretical foundations with MIT expert Constantinos Daskalakis in this comprehensive lecture.
Berkeley in the 80s - Manuel Blum's Contributions to Computing Theory
Explore Manuel Blum's groundbreaking research, advising philosophy, and insights on complexity theory, number theory, and consciousness in this engaging interview with the Turing Laureate.
MIP* = RE Part 1 - The Quantum Low-Degree Test
Explore quantum protocols, nonlocal games, and MIP* complexity, focusing on the Magic Square game and self-testing through representation theory in quantum computing.
The Learning With Errors Problem and Cryptographic Applications
Explore the Learning With Errors problem, its quantum reductions, and cryptographic applications in lattice-based cryptography, including digital signatures and security trapdoors.
Circuit Lower Bounds from Algorithm Design - An Overview I
Explore circuit lower bounds in computational complexity, focusing on algorithm design techniques and their implications for NP problems and Boolean functions.
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
Explores NP-hardness of approximating meta-complexity using cryptographic constructions, focusing on near-optimal results for Minimum Oracle Circuit Size Problem and its implications.
Capturing One-Way Functions via NP-Hardness of Meta-Complexity
Explores the characterization of one-way functions through worst-case hardness assumptions, linking NP-hardness and distributional Kolmogorov complexity to cryptographic foundations.
Derandomization: A Quick Tutorial
Explore efficient methods for transforming interactive protocols into NP-type verifiers, using targeted pseudorandom generators and complexity-theoretic assumptions.