Indiana University Bloomington

Luddy School of Informatics, Computing, and Engineering

Technical Report TR210:
Search Rearrangement Backtracking Often Requires Exponential Time to Verify Unsatisfiability

John Franco
(Dec 1986)
[Revised: April, 1987]
Abstract:
The abstact is not available. Please see the full paper.

Available as: