A Framework for Differentiable Discovery of Graph Algorithms
Explore graph algorithm discovery using deep learning and tree decomposition. Learn effective techniques for NP-complete problems with interpretable results and expanded search space.
Fast FPT-Approximation of Branchwidth
Explore efficient graph decomposition techniques and FPT algorithms for approximating branchwidth, with applications in structural graph theory and dynamic programming.
Daniel Dadush- Integer Programming and the Kannan-Lovasz Conjecture
Explore advanced integer programming techniques, lattice theory, and the Kannan-Lovasz conjecture in this high-level overview of solving n-variable integer programs efficiently, with insights into recent progress and key concepts.
Sparse Integer Programming Is FPT
Explore sparse integer programming's fixed-parameter tractability, its implications for parameterized complexity, and related concepts in variable dimension optimization.
Face Structures of Tropical Polyhedra
Explore tropical polyhedra's face structures, focusing on monomial tropical polyhedra to overcome issues in classical definitions and investigate combinatorial properties.
Tropical Solutions to Hard Problems in Auction Theory
Explore tropical mathematics' applications in auction theory, neural networks, and statistics through polytopes, algorithms, and semigroup matrices, unveiling powerful problem-solving techniques.
Gamma Convergence - Lecture 2
Explore gamma convergence, minimization problems, and homogenization in this advanced mathematics lecture. Learn about coercivity, lower semicontinuity, and integral functions in the context of multi-scale analysis.
Numerical Stability of Algorithms at Extreme Scale and Low Precisions
Explore numerical stability in extreme-scale computing and low-precision arithmetic, focusing on error bounds, blocked algorithms, and probabilistic analysis for matrix computations.
Embeddings and Tverberg-Type Problems: New Algorithms and Undecidability Results
Explore computational topology: algorithmic embeddability, undecidability in higher dimensions, and polynomial-time decidability of r-Tverberg problem in metastable range.
Computing Minimal Persistent Cycles - Polynomial and Hard Cases
Explores computing minimal persistent cycles in algebraic topology, discussing polynomial and NP-hard cases, and presenting algorithms for weak pseudomanifolds with applications to scientific data analysis.
Nathanael Cox - Effective Algorithms for Quotients of Semi-Algebraic Equivalence Relations
Explore efficient algorithms for computing quotients of semi-algebraic equivalence relations, focusing on complexity, tools, and key results in applied algebraic topology.
Parameterized Complexity of Quantum Invariants of Knots
Explore quantum invariants of knots, their parameterized complexity, and efficient algorithms for computation using graphical calculus and tree embeddings.
Harry Altman- Lower Sets in Products of Well Ordered Sets
Explore well partial orders, lower sets in products of ordinals, and weakly decreasing sequences. Gain insights into maximum linearizations and the surreal exponential.
Edith Elkind- Coalitional Games on Sparse Social Networks
Explore coalitional games on social networks, analyzing graph structures, computational complexity, and solution concepts for connected subsets of agents.
Random Matrices and the Uses of Dyson-Schwinger Equations - III
Explore advanced topics in random matrix theory, including Dyson-Schwinger equations, operator algebra, and central limit theorems, with applications in mathematical physics.
Solving the 4NLS with White Noise Initial Data
Explore white noise initial data in solving 4NLS, covering Hamiltonian PDE, globalization arguments, and limit equations. Gain insights into complex mathematical concepts and proofs.
Slope Detection in 3-Manifolds
Explore key concepts in 3-manifold topology, including slope detection, Lagrangian theory, and foliations. Learn about conjectures, theorems, and algorithms in this advanced mathematical field.
Derek Holt- Algorithms for Finitely Presented Groups III
Explore advanced algorithms for finitely presented groups, including Todd-Coxeter coset enumeration, Reidemeister-Schreier algorithm, and automatic structures. Learn applications in group theory and computational methods.
Viswanath Nagarajan - Stochastic Load Balancing on Unrelated Machines
Explores stochastic load balancing on unrelated machines, presenting a constant factor approximation algorithm for minimizing expected makespan. Discusses LP relaxation and rounding techniques.
David Cerna: Proof Schema and the Refutational Complexity of Their Cut Structure
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.
Finding Perfect Matchings in Bipartite Hypergraphs
Explore efficient algorithms for finding perfect matchings in bipartite hypergraphs, extending Haxell's condition and the Hungarian algorithm to hypergraph structures.