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

20 results for “Basic knowledge of algorithms”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.ITcs.CCTheoreticalRecentJun 22, 2026

Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method

Eduardo Yuji Sakabe, Felipe S. Abrahão, Santiago Hernández-Orozco, Ricardo Gudwin +1 more

The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.

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 →
math.OCcs.DSTheoreticalRecentOct 19, 2026

Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time

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.

View →
cs.DCcs.CCcs.FLTheoreticalRecentJun 9, 2026

Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties

Chiara Piombi

The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.

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.CCTheoreticalRecentJul 31, 2026

On the Complexity of Computing Outputs of a Metric Turing Machine

Yaroslav Ivanashev

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…

View →
cs.DSTheoreticalRecentOct 19, 2026

A Tight Oracle Threshold for \(k\)-Submodular Maximization

Siyuan Chen

The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.

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 →
cs.DScs.CCTheoreticalRecentJul 31, 2026

A Subsampling Theorem for Constraint Satisfaction Problems with Large Arity

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Gabriele Farina +1 more

The paper presents a new subsampling theorem for Constraint Satisfaction Problems (CSPs) with improved sample size requirements.

View →
cs.PLmath.OCTheoreticalRecentJun 9, 2026

Max-Policy Iteration, Revisited

David Monniaux, Helmut Seidl

This paper improves max-policy iteration by replacing mathematical optimization with value iteration and proposes min-policy iteration as an alternative to linear programming.

View →
math.COcs.CCTheoreticalRecentJul 9, 2026

Polynomial Binary Optimization

Endre Boros

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…

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.DSTheoreticalRecentOct 19, 2026

Integer Programing: An Algorithm with Exponent Linear in the Dimension

Lin Chen, Yuchen Mao, Guochuan Zhang

The authors provide a deterministic algorithm for solving integer programs in standard form with improved running time.

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.DSTheoreticalRecentJul 3, 2026

Optimality-Preserving Data Reduction for Maximum k-Cut (Full Version)

Michael Kaibel, Petra Mutzel

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…

View →
cs.CCcs.DSTheoreticalRecentOct 25, 2026

Unconditional Lower Bounds for the Fredman--Khachiyan Algorithms for Monotone Boolean Duality Testing

Khaled Elbassioni

This paper proves lower bounds on the number of recursive calls made by two algorithms for monotone Boolean duality testing.

View →