IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this article or follow this journal

Two measures of difficulty (*)

  • Scott E. Page

    (Division of Humanities and Social Sciences 228-77, California Institute of Technology, Pasadena, CA 91125, USA)

Registered author(s):

    The paper constructs two measures of difficulty for functions defined over binary strings. The first of these measures, cover size, captures the difficulty of solving a problem in parallel. The second measure, ascent size, captures the difficulty of solving a problem sequentially. We show how these measures can help us to better understand the performance of genetic algorithms and simulated annealing, two widely used search algorithms. We also show how disparities in these two measures may shed light on the organizational structure of firms.

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below under "Related research" whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Article provided by Springer in its journal Economic Theory.

    Volume (Year): 8 (1996)
    Issue (Month): 2 ()
    Pages: 321-346

    as
    in new window

    Handle: RePEc:spr:joecth:v:8:y:1996:i:2:p:321-346
    Note: Received: October 31, 1994; revised version December 7, 1994
    Contact details of provider: Web page: http://link.springer.de/link/service/journals/00199/index.htm

    Order Information: Web: http://link.springer.de/orders.htm

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:8:y:1996:i:2:p:321-346. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)

    or (Christopher F Baum)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.