Generalized Knapsack problems and fixed degree separations
type: Item
instance of: scholarly article
title: Generalized Knapsack problems and fixed degree separations
zbMATH Open document ID: 0900.68212
DOI: 10.1016/0304-3975(96)00002-3
author: Felipe Cucker
author: Michael Shub
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 984578
MaRDI profile type: Publication
full work available at URL: 0304-3975(96)00002-3
OpenAlex ID: W2063725460
cites work: Q3692867
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Computing over the reals with addition and order: Higher complexity classes
cites work: Separation of complexity classes in Koiran's weak model
cites work: Q4143433
cites work: Computing over the reals with addition and order
cites work: A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
cites work: Lower bounds for arithmetic networks
cites work: Q5655273
description: scientific article; zbMATH DE number 984578