Relation between the hardness of a problem and the number of its solutions
type: Item
instance of: scholarly article
title: Relation between the hardness of a problem and the number of its solutions
zbMATH Open document ID: 1221.68096
author: Than Quang Khoat
published in: Acta Mathematica Vietnamica
publication date: 2011-06-03T00:00:00Z
full work available at URL: Toc ACTA 1 36.htm
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5903970
zbMATH Keywords: hardness of a problem
zbMATH Keywords: number of solutions
zbMATH Keywords: subset sum problem
zbMATH Keywords: knapsack problem
zbMATH Keywords: bounded integer programming problem
zbMATH Keywords: knapsack optimization problem
zbMATH Keywords: NP-hard
MaRDI profile type: Publication
Recommended article: The Complexity and Distribution of Hard Problems
Recommended article: A complexity theory for hard enumeration problems
Recommended article: Q4448375
Recommended article: Complexity of counting the optimal solutions
Recommended article: Complexity of Counting the Optimal Solutions
Recommended article: Q4910734
Recommended article: The Number of Solutions Sufficient for Solving a Family of Problems
Recommended article: Q4542552
Recommended article: Counting the number of solutions for instances of satisfiability
description: scientific article; zbMATH DE number 5903970