Arrays of distinct representatives --- a very simple NP-complete problem
type: Item
instance of: scholarly article
title: Arrays of distinct representatives --- a very simple NP-complete problem
zbMATH Open document ID: 0879.68040
DOI: 10.1016/S0012-365X(97)89167-4
published in: Discrete Mathematics
publication date: 1997-08-10T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1047098
zbMATH Keywords: NP-complete problem
author: Dmitry G. Fon-Der-Flaass
MaRDI profile type: Publication
cites work: Q3142409
cites work: Complexity of a 3-dimensional assignment problem
cites work: The list chromatic index of a bipartite multigraph
cites work: Q4198056
Recommended article: Sample complexity of the distinct elements problem
Recommended article: Q5423112
Recommended article: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Recommended article: On a Simple Class of Combinatorial Problems
Recommended article: A Generalization of Distinct Representatives and Its Applications
Recommended article: NP-completeness of some optimal sequencing problems with a given grouping of elements
Recommended article: Efficient exact algorithm for count distinct problem
Recommended article: A simple random assignment problem with a unique solution
Recommended article: A simplified NP-complete satisfiability problem
description: scientific article; zbMATH DE number 1047098