The planted tensor problem over finite fields: algorithms and cryptography

arXiv:2609.31256 · cs.DS, cs.CR · Submitted 2026-09-25 · Read on arXiv

cs.DS, cs.CR

Submitted: 2026-09-25

Updated: 2026-09-25

Terminology

• Unbalanced Oil and Vinegar — 3× in this paper
• Core — 2× in this paper · explained in 2 episodes
• Adjacency Matrix — 1× in this paper · explained in 1 episode
• Annual Symposium on Foundations of Computer Science — 1× in this paper
• Embeddings — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Edge-Private Matching Kernels Through Local Decoding
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing
• Scalable Algorithms for Approximate DNF Model Counting
• On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions