Belief and Survey Propagation
Explore belief and survey propagation algorithms for solving complex satisfiability problems, examining their applications and theoretical foundations in computational theory.
SAT-Solving
Explore the theory and practice of SAT-solving, delving into satisfiability concepts and advanced techniques in this comprehensive lecture by Armin Biere.
Games: From Logic and Automata to Algorithms
Explore the intersection of logic, automata, and algorithms through game theory, focusing on theoretical foundations and computational applications.
Berkeley in the 80s - Richard Karp and the Theory of Computing
In-depth interview with Turing Laureate Richard Karp, exploring his groundbreaking research on computational theory at Berkeley in the 1980s and its lasting impact on computer science.
Quantum Random Walks
Explore quantum random walks and their applications in algorithms, complexity, and cryptography, with insights from expert Andras Gilyen.
Classical Algorithms for Quantum Mean Values
Explore classical algorithms for quantum mean values, covering VQE limitations, runtime analysis, and applications to MAX 3-CUT and QAOA problems in quantum optimization.
Quantum Cryptography - Beyond QKD
Explore advanced quantum cryptography concepts beyond Quantum Key Distribution, delving into lattice-based algorithms and their applications in complex cryptographic systems.
Learning One-Hidden-Layer Neural Networks with Landscape Design
Explore optimization techniques for one-hidden-layer neural networks, focusing on landscape design and new objective functions to overcome traditional training challenges.
Fast Spectral Algorithms from Sum-of-Squares Analyses
Explore efficient spectral algorithms derived from sum-of-squares analyses, focusing on hierarchies, extended formulations, and matrix-analytic techniques in computational complexity.
A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
Explore efficient algorithms for submodular maximization with knapsack constraints, focusing on nearly-linear time solutions and their applications in discrete optimization.
Asymptotic and Null Controllability of an Advection-Diffusion Equation
Explore asymptotic analysis and null controllability of advection-diffusion equations, focusing on boundary and internal layer interactions as diffusion parameter approaches zero.
Beating the Integrality Ratio for S-T-Tours in Graphs
Explores a novel algorithm for the s-t-path graph TSP, achieving a 1.497 approximation ratio and surpassing the known integrality ratio of 3/2 through innovative techniques.
A 1.5-Approximation for Path TSP
Explores a 1.5-approximation algorithm for the Metric Path Traveling Salesman Problem, introducing novel techniques to handle larger s-t cuts and achieve a simplified approach matching Christofides' TSP algorithm.
Introduction to Parameterized Algorithms, Lecture I
Gentle introduction to parameterized complexity, focusing on basic techniques like branching, color coding, and kernelization. Explores connections to linear programming and discrete optimization.
BPHZ Renormalisation and Vanishing Subcriticality Limit of the Fractional Φ_d Model
Explores stochastic PDEs with fractional Laplacian, analyzing renormalization counterterms' behavior as parameters approach critical values. Illustrates BPHZ renormalization theory in a simplified context.
Algorithms for Computing Syzygies Over VX 1, …, X N, V a Valuation Ring
Explore algorithms for computing syzygies in polynomial rings over valuation domains, focusing on a general method without Gröbner bases and its combinatorial termination proof.
Recent Hardness of Approximation Results in Parameterized Complexity
Survey of recent hardness of approximation results in parameterized complexity, focusing on k-clique problem inapproximability, with technical insights and open problems discussion.
Mixed Integer Optimization in High Dimensions
Explore advanced techniques for solving high-dimensional mixed integer optimization problems, focusing on cutting-edge algorithms and theoretical foundations.
Parametrized Algorithms and Possible Future Directions
Explore current research and future directions in Parameterized Complexity, focusing on algorithmic approaches and potential areas for further investigation.
The Approximation Ratio of the k-Opt Heuristic for Euclidean TSP
Explore the k-Opt heuristic's approximation ratio for Euclidean TSP, improving upper bounds and providing new lower bounds for k ≥ 3, applicable to various p-norms.
LP-Norm Multiway Cut
Explores graph partitioning with lp-norm multiway cut, unifying min-sum and min-max variants. Discusses hardness, integrality gap, and approximation algorithm for this generalized problem.