scientific article; zbMATH DE number 1748587

MaRDI QIDQ4530472zbMATH OpenFDO

Authors Antje Strohmaier

Publication date 10 July 2002

zbMATH Keywords

parallel complexity theorytime complexity of problem solving

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05)

Recommendations

• Connectionist networks for constraint satisfaction
• NEURAL NETWORKS AND LINEAR PROGRAMMING FOR THE SATISFIABILITY PROBLEM
• Parallel unit resolution
• An artificial neural network satisfiability tester
• Neural networks for NP-complete problems

Cited in

(4)

• Solving SAT by Lagrange programming neural network with long and short term memories
• Parallel unit resolution
• High-order networks that learn to satisfy logic constraints
• An artificial neural network satisfiability tester

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