Finding approximate solutions to NP-hard problems by neural networks is hard (Q1186583): Difference between revisions

@@ Property / cites work @@
+On the power of neural networks for solving hard problems
+Normal rank
@@ Property / cites work @@
+The Complexity of Near-Optimal Graph Coloring
@@ Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Neural networks and physical systems with emergent collective computational abilities.
+Normal rank
@@ Property / cites work @@
+``Neural'' computation of decisions in optimization problems
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+On Approximate Solutions for Combinatorial Optimization Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(92)90261-s
+Normal rank
@@ Property / OpenAlex ID @@
+W2068321983
@@ Property / OpenAlex ID: W2068321983 / rank @@
+Normal rank