On approximate learning by multi-layered feedforward circuits (Q2581366): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2005.09.008
@@ Property / DOI: 10.1016/j.tcs.2005.09.008 / rank @@
-Normal rank
@@ Property / author @@
-Bhaskar Das Gupta
@@ Property / author: Bhaskar Das Gupta / rank @@
-Normal rank
@@ Property / author @@
-Barbara Hammer
@@ Property / author: Barbara Hammer / rank @@
-Normal rank
@@ Property / author @@
+Bhaskar Das Gupta
@@ Property / author: Bhaskar Das Gupta / rank @@
+Normal rank
@@ Property / author @@
+Barbara Hammer
@@ Property / author: Barbara Hammer / rank @@
+Normal rank
@@ 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/j.tcs.2005.09.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2121678276
@@ Property / OpenAlex ID: W2121678276 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity and approximability of finding maximum feasible subsystems of linear relations
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4039803
@@ Property / cites work: Q4039803 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness results for neural network approximation problems
+Normal rank
@@ Property / cites work @@
+Q4839059
@@ Property / cites work: Q4839059 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091004
@@ Property / cites work: Q4091004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4839060
@@ Property / cites work: Q4839060 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust trainability of single neurons
@@ Property / cites work: Robust trainability of single neurons / rank @@
+Normal rank
@@ Property / cites work @@
+The computational intractability of training sigmoidal neural networks
+Normal rank
@@ Property / cites work @@
+Q4259987
@@ Property / cites work: Q4259987 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Q4839054
@@ Property / cites work: Q4839054 / rank @@
+Normal rank
@@ Property / cites work @@
+Finiteness results for sigmoidal “neural” networks
+Normal rank
@@ Property / cites work @@
+On the complexity of polyhedral separability
@@ Property / cites work: On the complexity of polyhedral separability / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q4894121
@@ Property / cites work: Q4894121 / rank @@
+Normal rank
@@ Property / cites work @@
+Feedforward nets for interpolation and classification
+Normal rank
@@ Property / cites work @@
+Q4253255
@@ Property / cites work: Q4253255 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2005.09.008
@@ Property / DOI: 10.1016/J.TCS.2005.09.008 / rank @@
+Normal rank