scientific article; zbMATH DE number 67614

zbMATH Open0770.68099MaRDI QIDQ4013532FDOQ4013532

Authors: Jyh-Han Lin, Jeffrey Scott Vitter 

Publication date: 27 September 1992

Title of this publication is not available (Why is that?)

Recommendations

• Complexity of learning in artificial neural networks
• Publication:3484350
• scientific article
• The computational intractability of training sigmoidal neural networks
• scientific article; zbMATH DE number 2018620

zbMATH Keywords

optimal designneural netsNP-completetraining problemcascade netscomputational complexity of learning by neural netsneural net learning model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25)

Cited In (12)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal perceptrons for memorizing complex patterns
• Title not available (Why is that?)
• Self-regulated complexity in neural networks
• Loading Deep Networks Is Hard: The Pyramidal Case
• Title not available (Why is that?)
• On the complexity of belief network synthesis and refinement
• Complexity and neural networks
• On the complexity of computing and learning with multiplicative neural networks
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013532)