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

20 results for “Reduction”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.CCcs.DMTheoreticalRecentJul 10, 2026

Closing the Complexity Gap for Exact Domatic Number at Three and Four

Holger Spakowski

This paper proves DP-completeness of Exact-3-DNP and Exact-4-DNP by reducing 3SAT to these problems.

View →
cs.CCTheoreticalRecentJun 27, 2026

One Hex reduction to rule them all: Quoridor, Maze Attack, Pinko Pallino and Blockade are PSPACE-complete

Francesco Carboni, Daniele Muscillo

The paper settles the computational complexity of Quoridor and related games by reducing them to Reisch's planar graph-Hex.

View →
cs.CCTheoreticalRecentJul 24, 2026

Ice Walk is ASP-Complete

Papangkorn Apinyanon

The authors prove that the solution-search problem for Ice Walk puzzle is ASP-complete by reducing Hamiltonian cycles in a maximum-degree-3 spanning subgraph of a rectangular grid graph to Ice Walk so…

View →
cs.ITcs.DMTheoreticalRecentOct 19, 2026

Block basis reduction for linear codes in non-Hamming metrics

N. S. Kolesnikov, S. A. Novoselov

The paper generalizes the code basis reduction to non-Hamming metrics and proposes a block basis reduction algorithm for codes that works for all coordinate-additive metrics.

View →
cs.DScs.CGcs.LGTheoreticalRecentJul 3, 2026

Dimension Reduction for Curves: Simplified and Generalized

Matthijs Ebbens, Jie Lu, Alexander Munteanu

This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…

View →
cs.CCcs.LOTheoreticalRecentOct 25, 2026

Propositional formula minimization is $Σ_2^p$-complete under many-one reductions

Reijo Jaakkola

The authors prove that the Minimum Equivalent Expression problem is Σ2^p-complete under polynomial-time many-one reductions.

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.CCTheoreticalRecentJun 16, 2026

Directed Reachability-Preserving Minimum Edge Cut: Approximation and Planar Hardness

Qi Duan

This paper presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

View →
math.COcs.DMTheoreticalRecentJun 8, 2026

Biclique decompositions from Welzl orders

Jean Cardinal, Rose McCarty, Yelena Yuditsky

This paper shows that certain types of graphs can be represented compactly using biclique decompositions.

View →
cs.CCTheoreticalRecentJun 12, 2026

Three-Terminal Reachability-Preserving Minimum Node Cut: Planar Hardness and a General-Graph \(O(\sqrt n)\)-Approximation

Qi Duan

This paper studies the three-terminal reachability-preserving minimum node cut problem and provides a polynomial-time approximation algorithm and proves NP-completeness for weighted planar graphs.

View →
math.LOcs.CCTheoreticalRecentOct 23, 2026

On the complexity of Medvedev reducibility

Remi Pallen

This paper studies the complexity of using the Medvedev lattice to classify effective closed sets.

View →
math.COcs.DMTheoreticalRecentJul 8, 2026

A coarse block-cut tree theorem

Júlia Baligács, Václav Blažej, Jadwiga Czyżewska, Michał Pilipczuk +1 more

This paper proves a coarse tree decomposition of graphs with bounded adhesion sets and separators.

View →
cs.CCmath.NTTheoreticalRecentAug 12, 2026

Euclidean SVP is deterministically NP-hard to approximate within any constant factor

Daqing Wan

The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.

View →