20 results for “XP-time algorithms”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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…
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.
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…
This paper studies the properties of adjunction-universal machines and their implications on time-bounded Kolmogorov complexity.
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.
The authors improve the worst-case update time for fully dynamic (Δ+1)-coloring against an adaptive adversary.
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.
This paper strengthens the conditional running-time lower bound for a problem in graph theory under the Exponential Time Hypothesis.
The paper proposes a general approach to augmenting exact exponential-time algorithms for NP-hard problems using machine-learned predictions.
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…
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.
A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.
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…