scientific article; zbMATH DE number 861619

MaRDI QIDQ4871258zbMATH OpenFDO

Authors Gadi Pinkas, Rina Dechter

Publication date 10 May 1998

Full work available at URL https://arxiv.org/abs/cs/9510102

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Some results on the computational complexity of symmetric connectionist networks.
• scientific article; zbMATH DE number 1490012
• Seeking global minima
• A neural network unification

Cited in

(7)

• Some results on the computational complexity of symmetric connectionist networks.
• Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge
• Increasing the attraction area of the global minimum in the binary optimization problem
• Energy-Time Tradeoff in Recurrent Neural Nets
• Neural network dynamics without minimizing energy
• scientific article; zbMATH DE number 4074521 (Why is no real title available?)
• An accelerated procedure for solving binary optimization problems

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 Q4871258)