Latest Research in Computational Complexity
96 research papers · 2026 median publication year
Top Research Topics in Computational Complexity
- Data Structures and Algorithms — 36 papers
- Computational Complexity — 10 papers
- Logic — 7 papers
- Computer Science and Game Theory — 6 papers
- Combinatorics — 5 papers
- Logic in Computer Science — 5 papers
- Artificial Intelligence — 3 papers
- Computational Geometry — 3 papers
- Complexity and Algorithms in Graphs — 3 papers
- Discrete Mathematics — 2 papers
Highest-Cited Papers
- Streaming Hypergraph Coloring via Palette Sparsification
- Reintroducing the Second Player in EPR
- Solving Minimum Span Antibandwidth and Cyclic Antibandwidth Labeling Problems
- Kim-forking for hyperimaginaries in NSOP1 theories
- Universal set families for maximization of nonnegative submodular and XOS functions
- A Separator-based Algorithm for the Graph Edit Distance Problem
- A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities
- Near-Logarithmic Inapproximability of Parameterized Set Cover
- Faster Verification of PJR$^+$ via Mincuts
- Efficient Randomized Communication Without Large Monochromatic Rectangles
- Routing Multiple Agents Below the Sum of Distances
- Maximum Matching Size for Bounded Arboricity Graphs in the Dynamic Graph Stream Model using $\tilde{O}(n^{2/3})$ space
- Rational Reductions and Regular Languages of Constant Circuit Complexity
- Solving 2-MAXSAT in Polynomial Time: a Proof of $\textit{P}$ = $\textit{NP}$
- High-Multiplicity Bin Packing is FPT
- A deterministic $(2 + \varepsilon)$-approximation for directed feedback vertex sets in tournaments
- On the completeness of several fortification-interdiction games in the Polynomial Hierarchy
- A 3.7321-Competitive Algorithm for Matroid Secretary
- One Color Preprocessing Improves DSATUR
- A tight 1/3-approximation algorithm and fully polynomial-time approximation schemes for the Colored Knapsack Problem