20 results for “Basic knowledge of algorithms”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.
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.
Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver +1 more
This paper presents an initialization framework and rounding procedure for interior point methods in linear programming, ensuring strongly polynomial time complexity.
The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.
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 introduces classes of functions that compute the k-th solution for certain types of problems and proves their inter-reducibility with corresponding classes for different order functions. It…
The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.
This paper studies the properties of adjunction-universal machines and their implications on time-bounded Kolmogorov complexity.
The paper presents a new subsampling theorem for Constraint Satisfaction Problems (CSPs) with improved sample size requirements.
This paper improves max-policy iteration by replacing mathematical optimization with value iteration and proposes min-policy iteration as an alternative to linear programming.
The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…
The paper proposes a general approach to augmenting exact exponential-time algorithms for NP-hard problems using machine-learned predictions.
The authors provide a deterministic algorithm for solving integer programs in standard form with improved running time.
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.
This paper introduces structured cut sets, a novel preprocessing technique for Maximum k-Cut, and extends existing techniques from Maximum Cut. The rules are optimality-preserving and yield significan…
This paper proves lower bounds on the number of recursive calls made by two algorithms for monotone Boolean duality testing.