Solving satisfiability via Boltzmann machines
- 1 May 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 15 (5) , 514-521
- https://doi.org/10.1109/34.211473
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Algorithms for the maximum satisfiability problemComputing, 1990
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- Algorithms for testing the satisfiability of propositional formulaeThe Journal of Logic Programming, 1989
- Boltzmann machines for travelling salesman problemsEuropean Journal of Operational Research, 1989
- A satisfiability tester for non-clausal propositional calculusInformation and Computation, 1988
- Simulated Annealing: Theory and ApplicationsPublished by Springer Nature ,1987
- Solving satisfiability in less than 2n stepsDiscrete Applied Mathematics, 1985
- Optimization by Simulated AnnealingScience, 1983
- Algorithmic extremal problems in combinatorial optimizationJournal of Algorithms, 1982