IDEAS home Printed from https://ideas.repec.org/p/trn/utwpas/1103.html
   My bibliography  Save this paper

On Exact and Approximate Solutions for Hard Problems: An Alternative Look

Author

Listed:
  • R. S. Bartholo
  • C. A. Cosenza
  • F. A. Doria
  • M. Doria
  • A. Teixeira

Abstract

We discuss in an informal, general audience style the da Costa-Doria conjecture about the independence of the P = NP hypothesis and try to briefly assess its impact on practical situations in economics. The paper concludes with a discussion of the Coppe-Cosenza procedure, which is an approximate, partly heuristic algorithm for allocation problems.

Suggested Citation

  • R. S. Bartholo & C. A. Cosenza & F. A. Doria & M. Doria & A. Teixeira, 2011. "On Exact and Approximate Solutions for Hard Problems: An Alternative Look," ASSRU Discussion Papers 1103, ASSRU - Algorithmic Social Science Research Unit.
  • Handle: RePEc:trn:utwpas:1103
    as

    Download full text from publisher

    File URL: http://www.assru.economia.unitn.it/files/DP_03_2011.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    1. Bartholo, R.S. & Cosenza, C.A.N. & Doria, F.A. & de Lessa, C.T.R., 2009. "Can economic systems be seen as computing devices?," Journal of Economic Behavior & Organization, Elsevier, vol. 70(1-2), pages 72-80, May.
    2. K. Vela Velupillai, 2007. "A Computable Economist�s Perspective on Computational Complexity," Department of Economics Working Papers 0723, Department of Economics, University of Trento, Italia.
    3. Tjalling C. Koopmans & Martin J. Beckmann, 1955. "Assignment Problems and the Location of Economic Activities," Cowles Foundation Discussion Papers 4, Cowles Foundation for Research in Economics, Yale University.
    4. K. Vela Velupillai & Ying Fang Kao, 2011. "Herbert A. Simon," ASSRU Discussion Papers 1115, ASSRU - Algorithmic Social Science Research Unit.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    P vs. NP ; allocation problem; assignment problem; traveling salesman; exact solution for NP problems; approximate solutions for NP problems; undecidability; incompleteness;

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:trn:utwpas:1103. 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: (assru.tm@gmail.com). General contact details of provider: http://edirc.repec.org/data/detreit.html .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.