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

20 results for “KKL Theorem”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

math.COcs.CCcs.DMTheoreticalRecentJun 28, 2026

Toward a KKL Theorem for any HDX

Max Hopkins

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.

View →
quant-phcs.CRmath.CORecentMay 17, 2026

Module Lattice Security (Part IV): Probabilistic Polynomial Quantum Attack on Module-LWE over 2-Power Cyclotomics

Ming-Xing Luo

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.

View →
cs.ITcs.AImath.CTTheoreticalRecentJul 15, 2026

CAS I: A Geometric Coding Theorem

Romie Banerjee

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.

View →
cs.DMmath.NTTheoreticalRecentJul 16, 2026

Conjectural Decidability of the Skolem Problem

Florian Luca, Joël Ouaknine, James Worrell

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…

View →
cs.DMmath.COTheoreticalRecentJul 26, 2026

Set-defined graph classes: $χ$-boundedness meets tropical algebra

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.

View →
math.PRcs.DSTheoreticalRecentJun 25, 2026

A simple proof of rapid mixing on random regular graphs beyond uniqueness

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.

View →
cs.DMcs.LOmath.COTheoreticalRecentJul 3, 2026

Oddomorphisms, Split-Off Minors, and the Strong Roberson Conjecture

Arnar Á. Kristjánsson

The paper shows that an oddomorphism between graphs does not imply graph minor containment and introduces a new structural relation called split-off minor.

View →
math.PRcs.DMcs.FLTheoreticalRecentJun 28, 2026

Note on Finite-Automata Bernoulli Factories for Rational Functions

Renato Paes Leme, Jon Schneider

This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.

View →
cs.CCTheoreticalRecentJul 4, 2026

Additional properties of parity based bit-counting complexity classes and hierarchies

Tayfun Pay

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.

View →
quant-phcs.CCTheoreticalRecentJul 8, 2026

XOR Games at Full Tilt: The Hardness of Binary Nonlocal Games

Richard Cleve, Eric Culf, Aviv Taller

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.

View →
math.AGcs.CCmath.RTTheoreticalRecentJul 2, 2026

Computing the continuous symmetries of a parametrized variety

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.

View →
cs.CCTheoreticalRecentJul 26, 2026

New and Improved Concrete Lower Bounds for Orthogonal Vectors

Tameem Choudhury, Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan

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…

View →
cs.DMmath.COmath.DSTheoreticalRecentJun 11, 2026

The Curious Case of Reversible Elementary Second Order Cellular Automaton 115

Enrico Formenti, Supreeti Kamylia

The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.

View →