20 results for “KKL Theorem”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper introduces a local-to-global method for analyzing low influence functions on simplicial complexes and proves a local-to-global KKL-type Theorem.
This paper presents a quantum attack on Module-LWE based lattice schemes like ML-KEM, demonstrating a polynomial-time quantum algorithm with a high success probability.
This paper establishes a Coding Theorem in the context of symmetry groups and develops a connection between subgroups of a group and subsets of binary strings.
This paper introduces the concept of 'large' zeros in linear recurrence sequences and establishes that they either do not exist or are very sparse, which could lead to decidability of the Skolem Probl…
Sarosh Adenwalla, Samuel Braunfeld, Tomáš Hons, John Sylvester +1 more
This paper studies set-defined graph classes and proves that bounded unions of shift-colorable graphs form the fundamental obstruction to chromatic number boundness in these classes.
Andreas Göbel, Matthew Jenssen, Marcus Michelen, Marcus Pappik +2 more
Chen et al. prove a Poincaré inequality for Glauber dynamics of hard-core model on random regular graphs using Bochner--Bakry--Émery approach.
The paper shows that an oddomorphism between graphs does not imply graph minor containment and introduces a new structural relation called split-off minor.
This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.
The paper studies properties of parity based bit-counting complexity classes B|0|⊕P and B|1|⊕P, proves inclusions and closures, and shows they contain PH and are contained in CH.
This paper studies a variant of the quantum XOR game model, called tilted XOR games, and shows that approximating their quantum value to constant precision is RE-complete.
Benjamin Biaggi, Jan Draisma, Fulvio Gesmundo, Aida Maraj +1 more
This paper presents a polynomial-time Monte Carlo algorithm to determine the symmetry Lie algebra of a parametrized variety directly from the parametrization.
This paper unconditionally proves the Orthogonal Vectors and Monotone Orthogonal Vectors conjectures in concrete computational models, and provides stronger lower bounds for Boolean formulas and branc…
The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.