Generalized Knapsack problems and fixed degree separations (Q1351965): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(96)00002-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2063725460
@@ Property / OpenAlex ID: W2063725460 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3692867
@@ Property / cites work: Q3692867 / rank @@
+Normal rank
@@ Property / cites work @@
+On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
+Normal rank
@@ Property / cites work @@
+Computing over the reals with addition and order: Higher complexity classes
+Normal rank
@@ Property / cites work @@
+Separation of complexity classes in Koiran's weak model
+Normal rank
@@ Property / cites work @@
+Q4143433
@@ Property / cites work: Q4143433 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing over the reals with addition and order
@@ Property / cites work: Computing over the reals with addition and order / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Linear Search Algorithm for the             <i>n</i>             -Dimensional Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Lower bounds for arithmetic networks
@@ Property / cites work: Lower bounds for arithmetic networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q5655273
@@ Property / cites work: Q5655273 / rank @@
+Normal rank