20 results for “combinatorial discrepancy theory”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper provides an introduction to modern developments in combinatorial discrepancy theory, focusing on algorithmic and convex geometric ideas.
The paper proves that positive semidefinite matrices can be decomposed into signs with low discrepancy, even when their dimension and number are unknown.
The paper proves the existence of a setwise distinguishable family of 2^(2-o(1)) permutations of [n] and its applications to kernelization complexity of graph coloring problems.
This paper studies high-dimensional graph combinatorial hypothesis testing problems and characterizes statistical and computational thresholds for signal magnitude required for strong detection.
Dean Doron, Tal Leonov, Jonathan Mosheiff, Henrique Navas +2 more
This paper proves that random linear codes have nearly optimal discrepancy properties in various regimes, extending classical results and enabling new applications.
The paper provides improved bounds on the discrepancy of the online carpooling problem.
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.
This paper proves that the minimax lower bound of estimation for popular kernel discrepancies is n^-(1/2) on general topological spaces and under mild assumptions on the kernel.
This paper presents a randomized online signing algorithm that achieves constant prefix discrepancy with high probability under certain conditions.
This paper presents a simpler variation of the NC detection criterion for perfect matchings in bipartite graphs with improved parameters.
Computes class probabilities in block-independent disjoint probabilistic databases.
The paper proves that binary sequences derived from permutations are always X-rays of doubly stochastic matrices by relaxing constraints.
This paper studies the NP-completeness and provides a polynomial-time algorithm for the disjoint separators problem in planar graphs when all sizes are equal to one.
This paper proposes two algorithms for approximating the number of four-cycles in graph edge streams, improving upon existing theoretical bounds and handling non-concentrated four-cycles in one-pass.