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

page 1

page 2

page 3

page 4

research
10/25/2018

Maximum Independent Sets in Subcubic Graphs: New Results

The maximum independent set problem is known to be NP-hard in the class ...
research
12/22/2022

A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems

The complexity class NP of decision problems that can be solved nondeter...
research
02/09/2020

Optimal polynomial-time compression for Boolean Max CSP

In the Boolean maximum constraint satisfaction problem - Max CSP(Γ) - on...
research
02/27/2018

Finding a root of constrained quadratic polynomial system is NP-hard

Here, we prove that finding a root of a quadratic polynomial system with...
research
07/24/2018

A Note on Clustering Aggregation

We consider the clustering aggregation problem in which we are given a s...
research
07/23/2018

Maximum-Likelihood Network Reconstruction for SIS Processes is NP-Hard

The knowledge of the network topology is imperative to precisely describ...
research
01/17/2023

Calculating lexicase selection probabilities is NP-Hard

Calculating the probability of an individual solution being selected und...

Please sign up or login with your details

Forgot password? Click here to reset