Cover Image

On the Low Weight Polynomial Multiple Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ţiplea, Ferucio Laurenţiu, Lăzărescu, Simona-Maria
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity 68Q15, 68Q25, 14G50, 94A60
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polynomial Identity Testing via Evaluation of Rational Functions
by: Hu, Ivan, et al.
Published: (2022)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
by: Abdullah, Duaa, et al.
Published: (2025)

How Does Machine Learning Manage Complexity?
by: Fortnow, Lance
Published: (2026)

Leakage-Resilient Hardness Equivalence to Logspace Derandomization
by: Shalunov, Yakov
Published: (2023)

There Are No Post-Quantum Weakly Pseudo-Free Families in Any Nontrivial Variety of Expanded Groups
by: Anokhin, Mikhail
Published: (2023)

Beyond the Existential Theory of the Reals
by: Schaefer, Marcus, et al.
Published: (2022)

The Separation of $NP$ and $PSPACE$
by: Lin, Tianrong
Published: (2021)

Vanishing of Schubert Coefficients
by: Pak, Igor, et al.
Published: (2024)

Positivity of Schubert Coefficients
by: Pak, Igor, et al.
Published: (2024)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
by: Lin, Tianrong
Published: (2023)

Cluster Vertex Deletion Problems on Cubic Graphs
by: Rusu, Irena
Published: (2025)

On the Complexity of the Minimum-($k,ρ$)-Shortcut Problem
by: Avila, Tatiana Rocha, et al.
Published: (2026)

Shifted Partial Derivative Polynomial Rank and Codimension
by: Edwards, Darren J.
Published: (2025)

Average hardness of SIVP for module lattices of fixed rank
by: de Boer, Koen, et al.
Published: (2025)

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
by: Marković, Petar, et al.
Published: (2026)

Some derivations among Logarithmic Space Bounded Counting Classes
by: Janaki, V., et al.
Published: (2023)

Unifying lower bounds for algebraic machines, semantically
by: Seiller, Thomas, et al.
Published: (2018)

Looking for all solutions of the Max Atom Problem (MAP)
by: Truffet, Laurent
Published: (2024)

A Hybrid Deep Learning and Anomaly Detection Framework for Real-Time Malicious URL Classification
by: Khaled, Berkani, et al.
Published: (2025)

Geometric Characteristics and Stable Guarantees for Phaseless Operators and Structured Matrix Restoration
by: Huang, Gao, et al.
Published: (2024)

A polynomial Time Algorithm to Solve The Max-atom Problem
by: Lahlou, Chams, et al.
Published: (2021)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
by: Bergougnoux, Benjamin, et al.
Published: (2025)

Undefinability of Approximation of 2-to-2 Games
by: Dawar, Anuj, et al.
Published: (2025)

Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines
by: Lin, Tianrong
Published: (2021)

Recent Advances in Debordering Methods
by: Dutta, Pranjal, et al.
Published: (2025)

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles
by: MIT Hardness Group, et al.
Published: (2024)

Compression with wildcards: All models of a Boolean 2-CNF
by: Wild, Marcel
Published: (2012)

Weighted Automata and Logics Meet Computational Complexity
by: Kostolányi, Peter
Published: (2023)

Failing to hash into supersingular isogeny graphs
by: Booher, Jeremy, et al.
Published: (2022)

Toward P vs NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model
by: Edwards, Darren J.
Published: (2025)

The Complexity of Resilience for Digraph Queries
by: Bodirsky, Manuel, et al.
Published: (2026)

No Constant-Cost Protocol for Point--Line Incidence
by: Göös, Mika, et al.
Published: (2026)

CircuitBuilder: From Polynomials to Circuits via Reinforcement Learning
by: Zhang, Weikun K., et al.
Published: (2026)

Fully Characterizing Lossy Catalytic Computation
by: Folkertsma, Marten, et al.
Published: (2024)

SQIAsignHD: SQIsignHD Adaptor Signature
by: Renan, Farzin, et al.
Published: (2024)

Completeness classes in algebraic complexity theory
by: Bürgisser, Peter
Published: (2024)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Low-temperature Sampling on Sparse Random Graphs
by: Galanis, Andreas, et al.
Published: (2025)

The Gallai Vertex Problem is $Θ_2^p$-Complete
by: Nikabadi, Amir, et al.
Published: (2026)

Vanishing of Schubert coefficients is in ${\sf AM}\cap {\sf coAM}$ assuming the GRH
by: Pak, Igor, et al.
Published: (2025)