Continuous dynamical systems that realize discrete optimization on the hypercube (Q2503628): Difference between revisions

@@ Property / cites work @@
+Nonlinear 0–1 programming: I. Linearization techniques
+Normal rank
@@ Property / cites work @@
+The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
+Normal rank
@@ Property / cites work @@
+Neural networks, error-correcting codes, and polynomials over the binary n-cube
+Normal rank
@@ Property / cites work @@
+Hamiltonian structure of dynamical systems which solve linear programming problems
+Normal rank
@@ Property / cites work @@
+Q5538300
@@ Property / cites work: Q5538300 / rank @@
+Normal rank
@@ Property / cites work @@
+On Dominating Sets and Independent Sets of Graphs
@@ Property / cites work: On Dominating Sets and Independent Sets of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Neural networks and physical systems with emergent collective computational abilities.
+Normal rank
@@ Property / cites work @@
+Neurons with graded response have collective computational properties like those of two-state neurons.
+Normal rank
@@ Property / cites work @@
+Q3029380
@@ Property / cites work: Q3029380 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof of the gradient conjecture of R. Thom.
@@ Property / cites work: Proof of the gradient conjecture of R. Thom. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3744948
@@ Property / cites work: Q3744948 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Local Search Problems that are Hard to Solve
+Normal rank
@@ Property / cites work @@
+Minimum-seeking properties of analog neural networks with multilinear objective functions
+Normal rank