4,439 records
- Polynomial mixing of the switch chain for every graphical degree sequence
- Randomized quasipolynomial-time mean-payoff games
- Simulating One-Tape Time in Two-Fifths-Power Space
- The complexity of identifying a graph by Weisfeiler–Leman refinement
- The PCP-for-PPAD conjecture: a quasilinear reduction
- Unconditional time lower bounds for Weisfeiler–Leman equivalence
- Variable-dimension Weisfeiler–Leman equivalence on general and subcubic graphs
- Formalization of Scott's Measurement Structures and Linear Inequalities in Lean 4
- AFT Neural Function Approximators for 1D Nonlinear Force Laws
- Singularity Analysis for the Perspective-Four and Five-Line Problems
- Precise Convergence Speed of Clipped SGD
- A Block Decomposed QUBO Workflow for Chromosome-Y Phylogeny Reconstruction
- MF-SCBO : Multi-fidelity Scalable Constrained Bayesian Optimization
- A Contraction Framework for Stochastic Operators with Bootstrapping: Application to TD Learning
- Sharp Lovasz-Theta Bounds on Random Graphs
- AT-SKM-Net: An Accelerated Trainable Sampling Kaczmarz-Motzkin Framework for Linear Hard-Constraint Feasibility on Dynamic Graphs
- On the SoS Certifiability of Log-Concave Distributions
- A General Composition Theorem for Approximate Degree
- A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model
- Spanning Trees with Many Leaves in Graphs of Minimum Degree at Least 7
- OpenHail: An Event-Driven Gymnasium Environment for Electric Ride-Hailing Fleet Control
- Suslin-Rao Codes : the bridge between pure and applied
- A New Upper Bound for 7-Universal Tournaments
- A cubic lower bound for border determinantal complexity of the permanent
- A Polynomial-Time 2-Approximation for Shortest Common Superstring
- A Polynomial-Time Algorithm for Three-Machine Unit-Job Scheduling
- Additive hardness and unbounded configuration gaps in bin packing
- Almost-Linear-Time Maximum-Cardinality Matching in General Graphs
- An Almost-Linear Approximation Scheme for Edit Distance
- An FPRAS for Cell-Bounded Contingency Tables
- Complex Matrix Multiplication Below 2.258 and Rectangular Bounds
- Constant-factor hardness of uniform sparsest cut
- Exact Uniform Sampling of Contingency Tables with Arbitrary Margins
- Hardness of finding large independent sets in three-colorable graphs
- Hellinger contraction with arbitrary Boolean output bias
- Near-square-root logarithmic integrality gaps for uniform sparsest cut
- One Rational Matrix Hitting Point for Noncommutative Formulas
- Polynomial Hitting Lists for Noncommutative Rational Formulas
- Quantitative lower bounds for trace reconstruction
- Sharp binary-information contraction on the discrete cube
- Single-exponential recovery and bounded-price strictness for metric k-median
- Squared-logarithmic randomized k-server on arbitrary metrics
- Staggered extraction for exact matrix multiplication over every field
- The approximation threshold for metric k-median
- Uniform computation of the squared-logarithmic k-server bound
- ZO-COSMO: Index-Free One-Hop Mixing for Decentralized Zeroth-Order Optimization
- KATOsuper: Surrogate-accelerated neural topology optimization with sensitivity-consistent Fourier neural operators
- What Converges in the Platonic Representation Hypothesis? Structure over Geometry
- Sparse-Observation Atmospheric Thermal Forecasting with Physics-Informed Neural Networks for Climate-Aware Digital Twins
- The Sharp Rényi and Tsallis Threshold in the Shepp--Olkin Concavity Problem