The paper shows that the envy-free cake-cutting problem with three agents is intractable and establishes the first lower bounds for the Jordan curve problem.

This paper settles the complexity of three sketching problems in graphs and distributions.

This paper proves that the satisfiability problem of existential Presburger arithmetic extended with divisibility predicates (EPAD) is PP-hard.

The paper analyzes preference-shaped expected improvement criteria for Bayesian multiobjective optimization, precisely characterizing when transformations preserve key properties like exact computatio…

The paper provides a constructive, intuitionistically valid proof of Rice's Theorem and the Halting Problem undecidability by reducing the problem to the undecidability of Hilbert's Tenth Problem (MRD…

The paper proposes a new DDH-based technique that significantly reduces the key size of multi-party Distributed Point Function (DPF) secret sharing schemes, achieving an $O( oot{3}{N})$ key size for h…

The paper introduces novel, efficient differentially private algorithms for estimating monotone statistics, significantly improving sample complexity compared to existing methods.

This paper presents a set of formulas and equations to compute the longest counting sequence of convex polyominoes of degree of convexity at most 2.

The paper proves that for resources with structural parallelizability (like divisibility and transferability), it is impossible to enforce a linear cost for concentrating influence, demonstrating that…

The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…

This paper introduces a new variant of the Traveling Salesman Problem where the goal is to find two paths connecting a set of sites while minimizing the Fréchet distance between the two paths.

The paper refutes Steurer's conjecture regarding the existence of large constant-separated sets within families of unit-norm vectors with low average correlation, using high-dimensional expanders to s…

The paper systematically studies the trade-offs between the number of slopes, bends per edge, and required area for planar drawings of bounded-degree graphs, providing new constructions for high-degre…

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 introduces Atomic Decomposition and Recombination (ADR), a novel framework that generates genuinely novel and challenging verifiable code tasks, significantly improving the scalability of Re…

MOSAIC is a multi-objective framework that efficiently allocates a fixed supervised fine-tuning budget by turning failure profiles into actionable data mixtures, significantly improving model alignmen…

The paper introduces Temporary Power Adjusting Withholding (T-PAW), a generalized and more potent block withholding attack than the existing PAW attack, demonstrating that this attack can yield signif…

The paper introduces PolyVeil, a protocol for private Boolean summation that uses permutation matrices in the Birkhoff polytope, achieving strong security guarantees while highlighting a fundamental t…

The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…