Standardized Tests and Affirmative Action - The Role of Bias and Variance
Explore the impact of bias and variance in standardized tests on affirmative action policies, examining their role in shaping educational opportunities and social equity.
Planar Graphs Have Bounded Queue-Number
Explore the theory of planar graphs and their bounded queue-number property, including history, extensions, and applications in graph theory.
A Deterministic Algorithm for Counting Colorings with 2Δ Colors
Explore a deterministic algorithm for counting colorings, delving into phase transitions, partition functions, and entropy conditions in graph theory.
Near Optimal Massively Parallel Graph Connectivity
Explore efficient parallel algorithms for graph connectivity, focusing on near-optimal solutions and innovative techniques for large-scale graph processing.
Polynomial Calculus Space and Resolution Width
Explore proof complexity, resolution systems, and space complexity in polynomial calculus, featuring combinatorial characterizations and discussions on total spaces and tight bounds.
A Tight Analysis of Bethe Approximation for Permanent
Explore the Bethe approximation for permanent, analyzing its accuracy and limitations through various approximation factors and distributions on perfect matchings and trees.
Expander Graphs - Both Local and Global
Explore expander graphs, their local and global properties, construction methods, and applications in this concise IEEE talk by experts in the field.
Inapproximability of Clustering in Lp Metrics
Explores computational complexity of clustering in Lp metrics, discussing approximation algorithms, hardness of approximation, and key concepts like Johnson Coverage Hypothesis.
Algorithms and Hardness for Linear Algebra on Geometric Graphs
Explore algorithms and hardness for linear algebra on geometric graphs, focusing on K and K-graphs, sparsifiers, matrix-vector multiplication, and Hamming nearest neighbor problems.
Adjacency Labelling for Planar Graphs - and Beyond
Explore adjacency labelling for planar graphs, covering universal graphs, labeling schemes, and the Strong Graph Product. Learn about binary search trees and their applications in graph theory.
Isomorphism Testing for Graphs Excluding Small Minors
Explore graph isomorphism algorithms for graphs excluding small minors, covering decompositions, t-CR-bounded graphs, and quasipolynomial-time solutions in this advanced theoretical computer science talk.
Low-Degree Hardness of Random Optimization Problems
Explore the challenges of random optimization problems, focusing on low-degree hardness and its implications for various mathematical models and algorithms.
The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
Explore average-case complexity of counting cliques in Erdos-Renyi hypergraphs, covering proof techniques, random KQ accounting, and binary expansions.
Faster Polytope Rounding, Sampling, and Volume Computation via a Sublinear Ball Walk
Explore advanced algorithms for efficient polytope analysis, including rounding, sampling, and volume computation using innovative Markov chain techniques.
More Barriers for Rank Methods, via a "Numeric to Symbolic" Transfer
Explore advanced concepts in tensor rank, including numeric-to-symbolic transfer techniques and their applications in mathematics and computer science.
Noise Sensitivity on the p-Biased Hypercube
Explore noise sensitivity on p-biased hypercubes, examining shell thresholds and speculating on results in this concise mathematical analysis.
Approximating Constraint Satisfaction Problems on High Dimensional Expanders
Explore high-dimensional expanders and their role in approximating constraint satisfaction problems, with insights on natural collections and general expanders.
Sampling Graphs Without Forbidden Subgraphs and Unbalanced Expanders With Negligible Error
Explore efficient graph sampling techniques and unbalanced expanders, focusing on avoiding forbidden subgraphs and achieving negligible error rates in computational applications.
Tree-Depth and the Formula Complexity of Subgraph Isomorphism
Explore tree-depth's impact on subgraph isomorphism complexity, examining special cases, formula complexity, and graph minor approximation in this theoretical computer science talk.
Composition Theorems via Lifting
Explore composition theorems in Boolean circuit complexity, focusing on KRW approach, conjectures, and recent advancements in monotone and semi-monotone compositions.
Towards Better Approximation of Graph Crossing Number
Explores advanced techniques for approximating graph crossing numbers, focusing on new frameworks and theorems for both general and bounded-degree graphs.