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

~ similar to 2608.05331· 20 results

cs.CCcs.DSRecentMay 30, 2026

Search-space Reduction for Boolean MinCSPs via Essential Constraints

Bart M. P. Jansen, Ruben F. A. Verhaegh

The paper introduces a method to efficiently detect 'essential' constraints in Boolean MinCSPs, significantly reducing the search space for solving these problems and providing a dichotomy theorem for…

View →
cs.DScs.CCTheoreticalRecentJul 31, 2026

A Subsampling Theorem for Constraint Satisfaction Problems with Large Arity

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Gabriele Farina +1 more

The paper presents a new subsampling theorem for Constraint Satisfaction Problems (CSPs) with improved sample size requirements.

View →
cs.DSTheoreticalRecentJun 26, 2026

Incremental Submodular Maximization: Better Than Greedy

Marcin Bienkowski, Joakim Blikstad, Jarosław Byrka, Martín Costa +2 more

The paper presents an adaptive scaling algorithm with a competitive ratio of 1.373 for incremental submodular maximization under increasing cardinality constraint, improving upon the previous best res…

View →
cs.GTcs.CCTheoreticalRecentJun 15, 2026

The Computational Complexity of Team Zero-Sum Games

Ioannis Anagnostides, Ioannis Panageas, Tuomas Sandholm, Jingming Yan

The paper establishes that computing Nash equilibria in team zero-sum games is PPAD-complete.

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.CRApr 12, 2026

Public Key Encryption from High-Corruption Constraint Satisfaction Problems

Isaac M Hair, Amit Sahai

The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

View →
math.OCcs.DMmath.ACTheoreticalRecentJun 15, 2026

Testing the max-flow min-cut property and the replication conjecture

Ahmad Abdi, Tamás Schwarcz

The authors verify the replication conjecture for cuboids of degree at most 9 and clutters over at most 10 elements.

View →
cs.DScs.DMmath.COTheoreticalRecentAug 4, 2026

Bicriteria Approximation Algorithms for Demand Matching

Yuchong Pan, Michel X. Goemans

This paper presents approximation algorithms and lower bounds for the demand matching problem, which generalizes the knapsack and b-matching problems.

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.CCTheoreticalRecentNov 12, 2026

Tight Algorithms for Conservative Finite-Valued CSPs Parameterized by Treewidth

Jakob Greilhuber, Dániel Marx, George Osipov, Marta Piecyk +2 more

This paper studies the complexity of valued constraint satisfaction problems with a fixed finite domain and constraint language.

View →
cs.CCcs.GTcs.LGTheoreticalRecentJun 15, 2026

The Complexity of Min-Max Optimization for Quadratic Polynomials

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alexandros Hollender

Computing approximate stationary points of min-max optimization over the hypercube is proven to be PPAD-hard for quadratic polynomials.

View →