EUVIMED · CrossrefZeitschrift
SIAM Journal on Computing
ISSN 0097-5397 · Society for Industrial & Applied Mathematics (SIAM)
Neueste Artikel
Order Selection Prophet Inequality
Path-Reporting Distance Oracles with Logarithmic Stretch and Size \({O}\)(\({n}\) \({\log \log }\) \({n}\))
Tarski’s Theorem, Supermodular Games, and the Complexity of Equilibria
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling
Commitments to Quantum States
Breaking the \({T^{2/3}}\) Barrier for Sequential Calibration
Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint
Constant-Depth Arithmetic Circuits for Linear Algebra Problems
Gapped Clique Homology on Weighted Graphs Is \({\text{QMA}_1}\)-Hard and Contained in QMA
The Bidirected Cut Relaxation for Steiner Tree Has Integrality Gap Smaller than 2
Reverse Mathematics of Complexity Lower Bounds
Agnostically Learning Multi-Index Models with Queries
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
The Orthogonal Vectors Conjecture and Nonuniform Circuit Lower Bounds
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
Faster Isomorphism Testing of p -Groups of Frattini Class 2
Dot-Product Proofs and Their Applications
Special Section on the Sixty-Fifth Annual IEEE Symposium on Foundations of Computer Science (2024)
Asymptotically Optimal Hardness for \({k}\)-Set Packing and \({k}\)-Matroid Intersection
The Average-Case Complexity of Counting Cliques in Erdoős–Reényi Hypergraphs
Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the Rescue
Internal Pattern Matching Queries in a Text and Applications
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\)
Reachability Preservers: New Extremal Bounds and Approximation Algorithms
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
The Approximation Ratio of the k -Opt Heuristic for the Euclidean Traveling Salesman Problem
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
An ETH-Tight Exact Algorithm for Euclidean TSP
Jahrgänge
2026 · 482025 · 742024 · 762023 · 682022 · 682021 · 652020 · 652019 · 562018 · 812017 · 622016 · 702015 · 572014 · 742013 · 952012 · 722011 · 762010 · 1032009 · 832008 · 942007 · 832006 · 782005 · 982004 · 702003 · 782002 · 552001 · 682000 · 1341999 · 871998 · 1441997 · 841996 · 621995 · 791994 · 791993 · 811992 · 711991 · 721990 · 771989 · 841988 · 801987 · 73
EUVIMED