20 results for “Reduction”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper proves DP-completeness of Exact-3-DNP and Exact-4-DNP by reducing 3SAT to these problems.
The paper settles the computational complexity of Quoridor and related games by reducing them to Reisch's planar graph-Hex.
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…
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.
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…
The authors prove that the Minimum Equivalent Expression problem is Σ2^p-complete under polynomial-time many-one reductions.
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 presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.
This paper shows that certain types of graphs can be represented compactly using biclique decompositions.
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.
This paper studies the complexity of using the Medvedev lattice to classify effective closed sets.
This paper proves a coarse tree decomposition of graphs with bounded adhesion sets and separators.
The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.