WorldCat Linked Data Explorer

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

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

Reference Machines Require Non-Linear Time to Maintain Disjoint Sets

This paper describes a machine model intended to be useful in deriving realistic complexity bounds for tasks requiring list processing. As an example of the use of the model, the paper shows that any such machine requires non-linear time in the worst case to compute unions of disjoint sets on-line. All set union algorithms known to me are instances of the model and are thus subject to the derived bound. One of the known algorithms achieves the bound to within a constant factor. (Author).

Open All Close All

type

about

http://schema.org/about

contributor

creator

description

http://schema.org/description

  • "This paper describes a machine model intended to be useful in deriving realistic complexity bounds for tasks requiring list processing. As an example of the use of the model, the paper shows that any such machine requires non-linear time in the worst case to compute unions of disjoint sets on-line. All set union algorithms known to me are instances of the model and are thus subject to the derived bound. One of the known algorithms achieves the bound to within a constant factor. (Author)."@en

name

http://schema.org/name

  • "Reference Machines Require Non-Linear Time to Maintain Disjoint Sets"
  • "Reference Machines Require Non-Linear Time to Maintain Disjoint Sets"@en
  • "Reference machines require non-linear time to maintain disjoint sets"@en
  • "Reference machines require non-linear time to maintain disjoint sets"

workExample