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

20 results for “approximation complexity”

CS papers only

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

Want pure semantic search? Try claim verification →

quant-phcs.CCTheoreticalRecentOct 7, 2026

Quantum Approximation Complexity of Classical Optimization Problems

Stuart Hadfield

The paper defines and studies the complexity classes for quantum approximation algorithms and establishes a hierarchy of quantum approximation classes.

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.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 →
cs.DSTheoreticalRecentJun 18, 2026

Tight Algorithm and Hardness for Submodular Linear Ordering

Evan Abboud, Roy Schwartz

The paper resolves the approximability of the Minimum Linear Ordering Problem for a general submodular function.

View →
cs.CCcs.DSTheoreticalRecentAug 5, 2026

On the Approximability of Boolean Max-$k$-CSP

Ainesh Bakshi

This paper presents a polynomial time algorithm for maximizing the number of satisfied constraints in a boolean constraint satisfaction problem, achieving a $(k/2^k)$-approximation.

View →
cs.CCcs.CRTheoreticalRecentOct 24, 2026

Bounds on polynomial approximations of the discrete logarithm function

Swastik Kopparty, Rishabh Kothary, Ashutosh Shankar

The authors improve bounds on how well polynomials can approximate the discrete log function.

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

$\tilde{O}$ptimal Algorithm for 2-Approximate All Pair Shortest Paths -- almost

Manoj Gupta, Mrigankashekhar Shandilya

This paper presents a randomized algorithm that runs in $ ilde{O}(n^2)$ time and, with high probability, guarantees a 2-approximation for all pairs at distance at least $c$ in an undirected, unweighte…

View →
cs.DScs.CCcs.ITTheoreticalRecentJun 9, 2026

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions

Yuzhou Gu, Xin Li, Yinzhan Xu

The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.

View →
cs.LGcs.NEcs.SCTheoreticalRecentJun 22, 2026

EML Trees Are Universal Approximators

Joe Germany, Elie Abdo, Joseph Bakarji

This paper studies the expressive power of tree-structured compositions of EML functions for function approximation.

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.DSTheoreticalRecentJun 15, 2026

Problems related to strong connectivity and strong biconnectivity

Raed Jaberi

This paper presents a 7-approximation algorithm for a problem in graph theory.

View →
cs.DSTheoreticalRecentJun 18, 2026

Sparsify Submodular Functions under Cardinality Constraints

Zhengting Bao, Dongrun Cai, Xue Chen

The paper studies submodular sparsification and provides efficient constructions of size-$O(n k^2 \log n)$ sparsifiers for summations of arbitrary submodular functions under cardinality constraints.

View →