Algorithms for Sparse Random 3XOR: The Low-Density Case - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

Algorithms for Sparse Random 3XOR: The Low-Density Case

Résumé

We present algorithms for variants of the 3XOR problem with lists consisting of random sparse $n$-bit vectors. We consider two notions of sparsity: low-density (each bit is independently biased towards zero) and low-weight (the Hamming weight of $n$-bit vectors is fixed). We show that the random sparse 3XOR problem can be solved in strongly subquadratic time, namely less than $\bigO{N^{2-\epsilon}}$ operations for a constant $\epsilon > 0$. This stands in strong contrast with the regular case, where it has not been possible to have the exponent drop below $2 - o(1)$. In the low-density setting, a very simple algorithm even runs in linear time with overwhelming success probability when the density is less than $0.0957$. Our algorithms exploit the randomness (and sparsity) of the input in an essential way.
Fichier principal
Vignette du fichier
main1.pdf (655.9 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02306917 , version 1 (07-10-2019)
hal-02306917 , version 2 (12-05-2020)
hal-02306917 , version 3 (01-03-2021)
hal-02306917 , version 4 (02-10-2021)

Identifiants

  • HAL Id : hal-02306917 , version 4

Citer

Charles Bouillaguet, Claire Delaplace, Antoine Joux. Algorithms for Sparse Random 3XOR: The Low-Density Case. 2021. ⟨hal-02306917v4⟩
279 Consultations
300 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More