Efficient local search for very large-scale satisfiability problems
- 1 January 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGART Bulletin
- Vol. 3 (1) , 8-12
- https://doi.org/10.1145/130836.130837
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- 3,000,000 Queens in less than one minuteACM SIGART Bulletin, 1991
- A polynomial time algorithm for the N-Queens problemACM SIGART Bulletin, 1990
- Refutational theorem proving using term-rewriting systemsArtificial Intelligence, 1985
- Optimization by Simulated AnnealingScience, 1983
- Average time analysis of simplified Davis-Putnam proceduresInformation Processing Letters, 1982
- Statistical Mechanics algorithm for Monte Carlo optimizationPhysics Today, 1982
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960