A Caltech Library Service

Two Measures of Difficulty

Page, Scott E. (1995) Two Measures of Difficulty. Social Science Working Paper, 927. California Institute of Technology , Pasadena, CA. (Unpublished)

[img] PDF (sswp 927 - May 1995) - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


This paper constructs two measures of difficulty for functions defined over binary strings. The first of these measures, cove r size, captures the difficulty of solving a problem in parallel. The second measure, ascent size, captures the difficulty of solving a problem sequential. 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.

Item Type:Report or Paper (Working Paper)
Related URLs:
URLURL TypeDescription ItemPublished Version
Additional Information:This paper has benefited from comments by seminar participants the NBER\CEME Decentralization Conference, UC-Irvine, and UC-San Diego. The author would like to thank Stan Reiter for his guidance and for his many suggestions in helping refine the concepts developed in this paper. Art Devany, Gordon Green, Jim Jordan, Nick Vriend, and an anonymous referee made helpful comments on earlier versions of this paper. Published as Page, Scott E. "Two measures of difficulty." Economic Theory 8, no. 2 (1996): 321-346.
Group:Social Science Working Papers
Series Name:Social Science Working Paper
Issue or Number:927
Classification Code:JEL: O22
Record Number:CaltechAUTHORS:20170818-133754197
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:80622
Deposited By: Jacquelyn Bussone
Deposited On:18 Aug 2017 21:44
Last Modified:03 Oct 2019 18:33

Repository Staff Only: item control page