On the average case complexity of backtracking for the exact-satisfiability problem
- 1 January 1988
- book chapter
- Published by Springer Nature
- p. 281-288
- https://doi.org/10.1007/3-540-50241-6_44
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On the probabilistic performance of algorithms for the satisfiability problemInformation Processing Letters, 1986
- A theoretical analysis of backtracking in the graph coloring problemJournal of Algorithms, 1985
- Average time analysis of simplified Davis-Putnam proceduresInformation Processing Letters, 1982