๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some NP-complete problems for hypergraph degree sequences

โœ Scribed by Charles J. Colbourn; W.L. Kocay; D.R. Stinson

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
641 KB
Volume
14
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Some NP-complete problems in linear prog
Some NP-complete problems in linear programming
โœ R. Chandrasekaran; Santosh N. Kabadi; Katta G. Murthy ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 342 KB
Complete problems for monotone NP
Complete problems for monotone NP
โœ Iain A. Stewart ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 768 KB
Neural networks for NP-complete problems
Neural networks for NP-complete problems
โœ Marco Budinich ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 547 KB

combinatorial optimization is an active field of research in Neural Networks. Since the first attempts to solve the travelling salesman problem with Hopfield nets several progresses have been made. I will present some Neural Network approximate solutions for NP-complete problems that have a sound ma