An alternative to Ben-Or's lower bound for the knapsack problem complexity
type: Item
instance of: scholarly article
title: An alternative to Ben-Or's lower bound for the knapsack problem complexity
zbMATH Open document ID: 1002.68064
DOI: 10.1016/S0893-9659(01)00116-1
author: Valentin E. Brimkov
author: Stephan Stoyanov Danchev
published in: Applied Mathematics Letters
publication date: 2002-08-15T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1781876
zbMATH Keywords: algebraic complexity of the knapsack problem
MaRDI profile type: Publication
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Q3993418
cites work: Q4198056
cites work: Lower bounds for arithmetic networks
cites work: Tight complexity bounds for the two-dimensional real knapsack problem
cites work: Generalized Knapsack problems and fixed degree separations
cites work: Real data-integer solution problems within the Blum-Shub-Smale computational model
cites work: Some Remarks on the Foundations of Numerical Analysis
description: scientific article; zbMATH DE number 1781876