WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/355538138

A General Method for Solving Divide-and-Conquer Recurrences

The complexity of divide-and-conqure algorithms is often described by recurrence relations of the form T(n) = kT(n/c) + f(n). The only method currently available for solving such recurrences consists of solution tables for fixed functions f and varying k and c. In this note we describe a unifying method for solving these recurrences that is both general in applicability and easy to apply without the use of large tables.

Open All Close All

type

about

contributor

creator

description

http://schema.org/description

  • "The complexity of divide-and-conqure algorithms is often described by recurrence relations of the form T(n) = kT(n/c) + f(n). The only method currently available for solving such recurrences consists of solution tables for fixed functions f and varying k and c. In this note we describe a unifying method for solving these recurrences that is both general in applicability and easy to apply without the use of large tables."@en

name

http://schema.org/name

  • "A General Method for Solving Divide-and-Conquer Recurrences"@en
  • "A General Method for Solving Divide-and-Conquer Recurrences"
  • "A general method for solving divide-and-conquer recurrences"@en
  • "A general method for solving divide-and-conquer recurrences"

workExample