TILens Daily Edition
2026-10-02
Filters: topic=algorithms, github=hidden

Stats: 87 articles, 3 sources, 87 research papers
Top topics: Algorithms, AI

## Research

- Unifying and Extending Strong Simulation of Quantum Circuits
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00547

- Improved Lower Bound for Steiner Point Removal
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00177

- Optimal Query Complexity for Ground-State Preparation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.35668

- Coloring 3-colorable graphs with $O(n^{4/23})$ colors via a Gaussian-cover recursion
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01071

- A Tight Second-Order Lower Bound for Routing Labels in Trees
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00310

- Solving Hypergraph Laplacian Systems in Almost-Linear Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.27651

- Convergence of Kikuchi matrices to $\Gamma$-independent and $q$-Gaussian limits
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02008

- Stable and Online Algorithms for Random Matrix Discrepancy
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01591

- Ranking and Rank Aggregation with Matroid Prefix Constraints
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.07153

- Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02131

- Query-efficient winner prediction in district-based elections
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00577

- Testing Bipartiteness in Logarithmic Rounds
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.13583

- Settling the Pass Complexity of Streaming Set Cover
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01007

- A computational phase diagram for the transverse field Ising model
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02079

- Exact Universality of Online Discrepancy
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00103

- Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.28260

- Achieving Optimal Redundancy for Small Dynamic Rank/Select Dictionaries
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01853

- Exponential quantum advantages for decoded quantum interferometry in the streaming setting
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01902

- Total Variation Distance Estimation through Domain Reduction
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.18707

- Quantum Query Complexity for List Search
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.38736

- Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2606.02183

- Faster Algorithms for Finding Small Induced Patterns in Sparse Host Graphs
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00567

- Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2601.10964

- Robust Non-Clairvoyant Scheduling with Classification Models
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01343

- Quantum state preparation for weighted d-DNNF
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02094

- Vertex-Failure Distance Oracles and Labeling Schemes: Compact and Constant-Approximate
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02016

- Adaptive and oblivious statistical adversaries are equivalent
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2410.13548

- Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
  Source: arxiv-cs-ds
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2509.07155

- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.15642

- Hutch#: Optimal non-adaptive Frobenius norm estimation
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.28472

- Factor Three Approximation for Edit Distance
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01311

- BalLOT: Balanced $k$-means clustering with optimal transport
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2512.05926

- A provable quantum advantage for approximate optimization via decoded quantum interferometry
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02145

- Beating One Half for Online Bipartite Matching with Reusable Resources
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01993

- The Power of Two-Choice Linear Probing
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00688

- Dynamic Connectivity, Minimum Spanning Tree, and 2-Edge Connectivity with Polylogarithmic Worst-Case Update Time
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00491

- Randomized Matvec Lower Bounds for Simplex-Based Matrix Games
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02095

- Polynomial-time classical and quantum simulation of quantum impurity models
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02167

- Fast Stencil Computations on a Single Arbitrarily Moving Interval
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.14879

- Beyond odd characteristic: Faster isomorphism testing of 2-groups of Frattini class 2
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00874

- A Faster Auction Algorithm for Weighted Matroid Intersection
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00920

- When Is Deletion Ordering Tractable? From Update Dynamics to Permutation Structure
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01149

- Faster Stable Numerical Polynomial Multiplication
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00387

- Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02146

- Best of Two Worlds: Combining High and Low Resolution to Compute Viewsheds on terrains
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00941

- Near-optimal quantum query lower bounds on bipartiteness and expansion testing in the bounded-degree graph model
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01752

- Exact Locality Gaps for Matchable Semi-Matchings
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01648

- Safe Hypergraph Contraction via Capacity-Aware Repair Certificates
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01678

- Sparsification Framework for Directed Densest Subgraph
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00846

- An EPTAS for Vector Scheduling with Time Intervals
  Source: arxiv-cs-ds
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.33493

- A proof of Lehmer's permutation conjecture for neighbor-swap graphs
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01240

- On solving integer bilevel optimization problems with a non-convex quadratic follower objective function using disjunctive cuts
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01197

- On the Power of Determinism in Multi-Item Auctions
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.35711

- An optimal constant for vector balancing with permutations
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02127

- Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.14058

- Reversing the Mostar line-graph inequality with long pendant paths
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00829

- On the Classical and Parameterized Complexity of Strong Odd Coloring
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01441

- New Records for the Hadamard Maximal Determinant Problem
  Source: arxiv-cs-dm
  Topic: Algorithms
  URL: https://arxiv.org/abs/2608.22518

- Exact Kernel Transfer to Clique Complexes and the Hardness of Normalized Persistence
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00075

- Short Resolution Refutations for CNFs with Bounded Weighted Incidence Treewidth
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02047

- Hardware-Algorithm Co-Optimization of Early-Exit Neural Networks for Multi-Core Edge Accelerators
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2512.04705

- Exact $T$-counts of Toffoli layers from an isotropy bound
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01024

- Can AI Oversight Be Zero Knowledge?
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01995

- Integer reachability in VASS with transfers: a refined complexity analysis
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01440

- Approximate Polynomial Satisfiability is in the Counting Hierarchy
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00644

- Exponential quantum advantage in processing massive classical data
  Source: arxiv-cs-cc
  Topic: Algorithms (+AI)
  URL: https://arxiv.org/abs/2604.07639

- Additional properties of parity based bit-counting complexity classes and hierarchies
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.04048

- Quantum space-depth tradeoffs for coherent block encodings
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2607.01843

- Entrywise Logarithmic Matrix Algebra and Dichotomy of Planar Graph Homomorphisms (Part I)
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00828

- A Full Complexity Dichotomy for Complex-Valued Boolean Holant Problems
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00081

- Planted Cliques and Quantum Symmetry-Adapted Measurements
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40310

- The Robustness of QAC0
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02154

- The Quantumly Fast and the Classically Forrious
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2602.07503

- When Matchgate Base Collapse Fails: A Qutrit Trichotomy and Unbounded Exact Width
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00079

- Optimal transducers using symmetries
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02133

- Noisy Quantum Query Complexity via Fractional Block Sensitivity
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00506

- A Noise Operator Approach to Quantum Query Complexity and Time-Space Tradeoff Lower Bounds
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2609.40334

- Toward a Characterization of Simulation Between Arithmetic Theories
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2604.27787

- A Degree--Size Relation for Resolution over Polynomials
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00837

- Good Quantum Locally Testable Codes from Lossless Cubical Complexes
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00525

- Beyond Light Cones: State Preparation Complexity in Quantum Spin Glasses
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02166

- Lower Bound of 22 for 3x3 Matrix Multiplication over the Integers
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01639

- Trapdoored Clifford Operators and Applications
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.01848

- Quantum state isomorphism problems for groups
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2605.12615

- Beyond IP = PSPACE and QIP = PSPACE: Interactive Proofs in Arbitrary Physical Theories
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00847

- Polynomial-time local-unitary equivalence of graph states
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.00527

- Time-space lower bounds for breaking quantum cryptography
  Source: arxiv-cs-cc
  Topic: Algorithms
  URL: https://arxiv.org/abs/2610.02101