20 results for “approximation complexity”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper defines and studies the complexity classes for quantum approximation algorithms and establishes a hierarchy of quantum approximation classes.
The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.
The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.
The paper resolves the approximability of the Minimum Linear Ordering Problem for a general submodular function.
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.
The authors improve bounds on how well polynomials can approximate the discrete log function.
The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.
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…
The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.
This paper studies the expressive power of tree-structured compositions of EML functions for function approximation.
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.
This paper presents a 7-approximation algorithm for a problem in graph theory.
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.