TILens Daily Edition
2026-08-21
Filters: topic=algorithms, github=hidden

Stats: 33 articles, 3 sources, 33 research papers
Top topics: Algorithms

## Research

- Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.08057

- Reducing the Complexity of Matrix Multiplication by Quantum Computing
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.05541

- Pod-Deployability in Kubernetes with Inter-Pod Affinity Constraints is PSPACE-Complete
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19822

- Constant-round quantum advantage in communication complexity for total functions
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19787

- Hausdorff Reductions and the Exponential Hierarchies
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2402.00791

- Proof of the hiding conjecture for Gaussian boson sampling with an arbitrary number of squeezed input modes
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19314

- The Non-Cancelling-Intersections Conjecture Fails for Left-Linear Trees
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19414

- On the order-diameter ratio of girth-diameter cages
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2511.21144

- Large Finite Point Sets Have 4 Collinear Points or a 6-Clique
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19468

- A method to identify the ordinary edges for symmetric traveling salesman problem based on frequency $K_i$s
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.15724

- Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.09633

- Broadcast Domination Number is at Most Twice the Multipacking Number
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20036

- Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.26271

- Sub-optimality of Marton's Inner Bound for the Two-Receiver Broadcast Channel
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19869

- How many cherry-picking sequences are needed to reduce all subtrees of a phylogenetic tree?
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19916

- The Honeycomb Framework for Code Bounds
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20287

- Online Multi-Level Aggregation with Per-Batch Maximum Delay
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.06796

- Breaking the $2^n$ Barrier for Counting Linear Extensions with a Short Elementary Algorithm
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19505

- Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2512.11785

- The Complexity of Boolean Connectivity Problem of $k$-Horn Formulas
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19569

- A Linear-Time Algorithm for Product Structure in Planar Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2202.08870

- Palette Sparsification for General Uniform Hypergraphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19623

- Compact Enumeration of Maximal Closed Substrings in Run-Length Encoded Strings
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.02838

- A Canonical m-Atomic Decomposition of Bipartite Graphs via a Grid Model
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20051

- Quantifying over Optimal MSO-Definable Sets on Graphs of Bounded Clique-Width
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20175

- Differentially Private Continual Release with Relative Error
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20230

- New Complexity Results for Fair Repetitive Scheduling
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19952

- The Greedy Superstring Algorithm Achieves Ratio 2 for Strings of Length 6 Already
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20018

- A simple and practical $o(\sqrt{n})$-time algorithm for shortest paths in power law graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19538

- Parameterized Complexity of Temporal Agony
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.20077

- Fast Algorithms for Stoquastic Spin Systems
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.19489

- Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.29944

- Orientation does not help with 3-coloring a grid in online-LOCAL
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2509.22233