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

20 results for “algorithmic techniques”

CS papers only

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

Want pure semantic search? Try claim verification →

math.HOcs.DMcs.DSTheoreticalRecentJul 31, 2026

Discrepancy Theory: An Algorithmic and Geometric Perspective

Nikhil Bansal, Aleksandar Nikolov

This paper provides an introduction to modern developments in combinatorial discrepancy theory, focusing on algorithmic and convex geometric ideas.

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.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.DSEmpiricalRecentJun 9, 2026

Enumerating Inclusion-Maximal Arithmetic Progressions

Brian Bemman, Maximilien Gadouleau, Oliver W. Gnilke, George B. Mertzios

A new algorithm is proposed for enumerating inclusion-maximal arithmetic progressions in a sequence, improving upon previous time complexity.

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.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.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.DScs.DMTheoreticalRecentAug 17, 2026

Efficient Enumeration of Enclosed Vector Spaces

Anna Bernasconi, Valentina Ciriani, Alessio Conte, Alberto L'Episcopo +1 more

This paper presents algorithms to enumerate and find maximal enclosed vector subspaces in a given set of vectors over a finite field, with a quadratic speed-up compared to brute force.

View →
math.COcs.CCTheoreticalRecentJul 10, 2026

Cut-homotopies and the complexity of edge-coloring problems

Alexey Barsukov, Roman Feller, Maximilian Hadek, Davide Perinti

The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…

View →
cs.NIEmpiricalRecentJul 27, 2026

Methods for Path Set Attribute Calculation in Network Systems

Giovanni Fiaschi, Carlo Vitucci, Thomas Westerbäck, Daniel Sundmark +1 more

This paper presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.

View →
cs.DMcs.DSmath.COTheoreticalRecentJun 16, 2026

An alternative way of defining finite graphs

Maxim Nazarov

The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.

View →
cs.PLcs.CCcs.FLRecentMay 30, 2026

Grid Programs: A Two-Dimensional, Variable-Free Model of Computation

Ezequiel López-Rubio

The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.

View →
cs.PLEmpiricalRecentJun 22, 2026

Lifting E-Graphs: A Function Isn't a Constant

Philip Zucker

An approach is described to support rigid α canonical variables in an e-graph.

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

A Unified Theory of Sparsification

Sanjeev Khanna, Aaron Putterman, Madhu Sudan

This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.

View →