Generalized Knapsack problems and fixed degree separations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3917710 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
- Computing over the reals with addition and order
- Computing over the reals with addition and order: Higher complexity classes
- Lower bounds for arithmetic networks
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Separation of complexity classes in Koiran's weak model
Cited in
(3)
This page was built for publication: Generalized Knapsack problems and fixed degree separations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1351965)