~ similar to 2608.05331· 20 results
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…
The paper presents a new subsampling theorem for Constraint Satisfaction Problems (CSPs) with improved sample size requirements.
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…
The paper establishes that computing Nash equilibria in team zero-sum games is PPAD-complete.
The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.
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).
The authors verify the replication conjecture for cuboids of degree at most 9 and clutters over at most 10 elements.
This paper presents approximation algorithms and lower bounds for the demand matching problem, which generalizes the knapsack and b-matching problems.
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.
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.
Computing approximate stationary points of min-max optimization over the hypercube is proven to be PPAD-hard for quadratic polynomials.