skip to content
Estimating the Efficiency of Backtrack Programs. Preview this item
ClosePreview this item
Checking...

Estimating the Efficiency of Backtrack Programs.

Author: Donald E Knuth; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE.
Publisher: Ft. Belvoir Defense Technical Information Center AUG 1974.
Edition/Format:   Book : English
Database:WorldCat
Summary:
One of the chief difficulties associated with the so-called backtracking technique for combinatorial problems has been the 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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Donald E Knuth; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE.
OCLC Number: 227372800
Description: 32 p.

Abstract:

One of the chief difficulties associated with the so-called backtracking technique for combinatorial problems has been the 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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227372800>
library:oclcnum"227372800"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:datePublished"AUG 1974"
schema:datePublished"1974"
schema:description"One of the chief difficulties associated with the so-called backtracking technique for combinatorial problems has been the 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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/137104681>
schema:inLanguage"en"
schema:name"Estimating the Efficiency of Backtrack Programs."@en
schema:numberOfPages"32"
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.