Luddy School of Informatics, Computing, and Engineering
Technical Report TR210:
Search Rearrangement Backtracking Often Requires Exponential Time to Verify Unsatisfiability
[Revised: April, 1987]
The abstact is not available. Please see the full paper.
Sorry, no electronic version of this paper is currently available. See
The Trustees of