ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “XP-time algorithms”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.FLcs.CRMar 27, 2026

Evolution-Based Timed Opacity under a Universal Observation Model

Zhe Zhang, Martijn Goorden, Michel Reniers

The paper establishes a unified framework for timed opacity by introducing a universal observation model and defining evolution-based timed opacity, proving its relationship to existing opacity defini…

View →
cs.LOcs.PLEmpiricalRecentJun 26, 2026

KoAT: Automatic Complexity and Termination Analysis of Integer Programs

Nils Lommen, Éléanore Meyer, Jürgen Giesl

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

View →
cs.DSTheoreticalRecentJun 16, 2026

Exact Algorithms for Edge Deletion to Cactus Graphs and Weighted Variants

Wenhao Song

This paper improves the time complexity of exact algorithms for converting a connected graph into a cactus by reducing it from O*(3^n) to O*(2^n) for unweighted graphs, and provides faster algorithms…

View →
cs.CCcs.DMTheoreticalRecentNov 6, 2026

Reconfiguration of Time-Bounded Descriptions

Dimitrios Myrisiotis

This paper studies the properties of adjunction-universal machines and their implications on time-bounded Kolmogorov complexity.

View →
math.NTcs.DScs.SCTheoreticalRecentJun 22, 2026

Faster enumeration of primes

David Harvey

This paper introduces new algorithms for finding prime numbers up to a given bound, achieving a speedup of log N over the sieve of Eratosthenes.

View →
cs.DSTheoreticalRecentOct 19, 2026

Dynamic $(Δ+1)$-Coloring Against an Adaptive Adversary: Faster, Simpler, Worst-Case, and Bounded Recourse

Yuval Gil, Magnús M. Halldórsson

The authors improve the worst-case update time for fully dynamic (Δ+1)-coloring against an adaptive adversary.

View →
cs.DSEmpiricalRecentAug 5, 2026

Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics

Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen +1 more

This paper demonstrates that treewidth dynamic programming (TDP) can be used to enhance the performance of various graph combinatorial optimization algorithms.

View →
cs.DSmath.COTheoreticalRecentJun 24, 2026

A Stronger Conditional Running-Time Lower Bound for Global Label Min-Cut

Yuanhao Wang, Wei Wang

This paper strengthens the conditional running-time lower bound for a problem in graph theory under the Exponential Time Hypothesis.

View →
cs.DScs.LGTheoreticalRecentJun 17, 2026

Learning Augmented Exact Exponential Algorithms

Tatiana Belova, Yuriy Dementiev, Danil Sagunov

The paper proposes a general approach to augmenting exact exponential-time algorithms for NP-hard problems using machine-learned predictions.

View →
cs.CCcs.LGTheoreticalRecentJun 11, 2026

The Program Is Still There: A Conservation Law for Program Discovery

Jorge Miguel Silva

This paper measures the lower bound for the shortest program generating a sequence, proving a conservation law and providing a deterministic engine to recover generating programs for certain sequences…

View →
cs.NEEmpiricalRecentJun 8, 2026

Local Search on Vertex Coloring for Bipartite Graphs

Johanna Gasse

This paper explores the capabilities and limitations of local search on the vertex coloring problem and introduces a new mutation operator that improves run time.

View →
cs.DScs.DMmath.COTheoreticalRecentJul 10, 2026

A Polynomial-Time Algorithm for Coloring Perfect Graphs Based on Walk Counting

Amir Ali Ahmadi, Pravesh K. Kothari, Yukai Tang

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

View →
cs.NEcs.AIcs.DSRecentMay 28, 2026

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems

Benjamin Doerr, Pietro S. Oliveto, John Alasdair Warwicker

This paper introduces a method to automatically determine the optimal learning period ($ au$) for the Random Gradient hyper-heuristic, enabling it to optimally solve Pseudo-Boolean Problems without ma…

View →