BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-74-442
       ENTRY:: August 23, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Estimating the efficiency of backtrack programs.
        TYPE:: Technical Report
      AUTHOR:: Knuth, Donald E.
        DATE:: August 1974
       PAGES:: 34
    ABSTRACT:: One of the chief difficulties associated with the so-called
               backtracking technique for combinatorial problems has been
               our inability to predict the efficiency of a given algorithm,
               or to compare the efficiencies of different approaches,
               without actually writing and running the programs. This paper
               presents a simple method which produces reasonable estimates
               for most applications, requiring only a modest amount of hand
               calculation. The method should prove to be of considerable
               utility in connection with D. H. Lehmer's branch-and-bound
               approach to combinatorial optimization.
       NOTES:: [Adminitrivia V1/Prg/19950823]
         END:: STAN//CS-TR-74-442