AI Chat AI Image Generator AI Video Text to Speech

No-Rainbow Problem is NP-Hard

03/26/2020

∙

by Dmitriy Zhuk, et al.

∙

∙

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to some specified constraints. In this paper we show that one of the most popular variants of the SCSP, called No-Rainbow Problem, is NP-Hard.

page 1

page 2

page 3

research

∙ 03/26/2020

No-Rainbow Problem and the Surjective Constraint Satisfaction Problem

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deci...

0 Dmitriy Zhuk, et al. ∙

research

∙ 04/04/2016

Asking the metaquestions in constraint tractability

The constraint satisfaction problem (CSP) involves deciding, given a set...

0 Hubie Chen, et al. ∙

research

∙ 07/13/2020

Strengthening neighbourhood substitution

Domain reduction is an essential tool for solving the constraint satisfa...

0 Martin C. Cooper, et al. ∙

research

∙ 10/25/2017

Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution

In this work, I present an optimization problem which consists of assign...

0 Daniel Severin, et al. ∙

research

∙ 09/21/2017

Complexity of Scheduling Charging in the Smart Grid

In the smart grid, the intent is to use flexibility in demand, both to b...

0 Mathijs de Weerdt, et al. ∙

research

∙ 05/28/2022

Travelling Salesman Problem: Parallel Implementations Analysis

The Traveling Salesman Problem (often called TSP) is a classic algorithm...

0 Amey Gohil, et al. ∙

research

∙ 07/07/2021

Minimum Constraint Removal Problem for Line Segments is NP-hard

In the minimum constraint removal (MCR), there is no feasible path to mo...

0 Bahram Sadeghi Bigham, et al. ∙