On explicit reductions between two purely algebraic problems: MQ and MLD

09/13/2021
by   Alessio Meneghetti, et al.
0

The Maximum Likelihood Decoding Problem (MLD) and the Multivariate Quadratic System Problem (MQ) are known to be NP-hard. In this paper we present a polynomial-time reduction from any instance of MLD to an instance of MQ, and viceversa.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset