Similar Items: Towards Settling the Complexity of the Lettericity Problem
- On the Complexity of the Matching Problem of Regular Expressions with Backreferences
- On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
- Handicap reduction for linear complementarity problems
- Accelerated Relax-and-Round for Concave Coverage Problems
- Streaming Complexity Separations for Dense and Sparse Graphs
- Temporal Routing in Static Networks: The Schedule Completion Problem