An unfeasibility view of neural network learning (Q2685066): Difference between revisions

@@ Property / author @@
-Luis Miguel Pardo
@@ Property / author: Luis Miguel Pardo / rank @@
-Normal rank
@@ Property / author @@
+Luis Miguel Pardo
@@ Property / author: Luis Miguel Pardo / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q114950931
@@ Property / Wikidata QID: Q114950931 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4302009122
@@ Property / OpenAlex ID: W4302009122 / rank @@
+Normal rank
@@ Property / cites work @@
+Neural Network Learning
@@ Property / cites work: Neural Network Learning / rank @@
+Normal rank
@@ Property / cites work @@
+Quiz games as a model for information hiding
@@ Property / cites work: Quiz games as a model for information hiding / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of cylindrical decompositions of sub-Pfaffian
+Normal rank
@@ Property / cites work @@
+Q3110218
@@ Property / cites work: Q3110218 / rank @@
+Normal rank
@@ Property / cites work @@
+Sur la complexité du principe de Tarski-Seidenberg
+Normal rank
@@ Property / cites work @@
+Multilayer feedforward networks are universal approximators
+Normal rank
@@ Property / cites work @@
+On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
+Normal rank