A neural algorithm for MAX-2SAT: Performance analysis and circuit implementation

Neural Networks

Volumn 10, Issue 3, 1997, Pages 555-560

  Alberti, Maria A ^b   Bertoni, Alberto ^b   Campadelli, Paola ^a   Grossi, Giuliano ^b   Posenato, Roberto ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b NONE

Author keywords

approximation; Hopfield networks; optimization; programmable gate arrays; satisfiability

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; LOGIC GATES; NEURAL NETWORKS; OPTIMIZATION; PERFORMANCE;

HOPFIELD NETWORKS; NEURAL ALGORITHM; PROGRAMMABLE GATE ARRAYS; SATISFIABILITY;

ALGORITHMS;

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; PRIORITY JOURNAL;

EID: 0031128034     PISSN: 08936080     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-6080(96)00065-2     Document Type: Article

References (18)

1. Aiyer S.V., Niranjan M., Fallside F. A theoretical investigation into the performance of the Hopfield model. IEEE Transaction on Neural Networks. 1(2):1990;204-215.
2. Alberti, M.A., Marelli, P., & Posenato, R. (1993). A neural algorithm for the maximum satisfiability problem. In Caianello, E. (Ed.), Parallel architectures and neural networks (pp. 173-179) Singapore. Università dgli Studi di Salerno, World Scientific Publishing Co.
3. Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1992). Proof verification and intractability of approximation problems. In Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science (pp. 14-23).
4. Ausiello G., Crescenzi P., Protasi M. Approximate solution of NP optimization problems. Theoretical Computer Science. 150:1995;1-56.
5. Crescenzi, P., Kann, V., Silvestri, R., & Trevisan, L. (1995). Structure in approximation classes. In Proceedings of the 1st Combinatorics and Computing Conference (Volume 959, pp. 539-548). Lecture Notes in Computer Science. Berlin: Springer Verlag.
6. Garey, M.R., & Johnson, D.S. (1979). Computers and intractability. A guide to the theory of NP-completeness. San Francisco: W.H. Freeman & Co.
7. Gee A.H., Aiyer S.V., Prager R.W. An analytical framework for optimization neural networks. Neural Networks. 6:1993;79-97.
8. Goemans, M., & Williamson, D. (1994). 0.878-approximation algorithms for max cut and max 2-sat. Preprint.
9. Hopfield, J.J. (1982). Neural networks and physical systems with emergent collective computational abilities. In Proceedings of the National Academy of Sciences, 79, 2554-2558.
10. Hopfield J.J., Tank D.W. Neural computation of decision in optimization problems. Biological Cybernetics. 52:1985;141-152.
11. Johnson D.S. Approximation algorithm for combinatorial problems. Journal of Computer and System Science. 1(9):1974;256-278.
12. Johnson D.S. More approaches to the travelling salesman guide. Nature. 330:1987;525.
13. Kamgar-Parsi B., Kamgar-Parsi B. On problem solving Hopfield neural network. Biological Cybernetics. 62:1990;415-423.
14. Karp, R. (1972). Reducibility among combinatorial problems (pp 85-103). Complexity of Computer Computations. New York: Plenum Press.
15. Knuth, D.E. (1976). Mariages stables et leurs relations avec d'autres problemes combinatoires. Introduction a l'analyse mathematique des algorithmes. Montreal: University of Montreal Press.
16. Wegener, I. (1987). The complexity of Boolean functions. Wiley-Teubner Series in Computer Science. Chichester, New York: John Wiley.
17. Wilson V., Pawley G. On the stability of the TSP problem algorithm of Hopfield and Tank. Biological Cybernetics. 58:1988;63-70.
18. XIL, (1993). The programmable gate array data book. XILINX.