On Exact and Approximate Solutions for Hard Problems: An Alternative Look
Download full text from publisher
References listed on IDEAS
- 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.
- 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.
- 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.
- K. Vela Velupillai & Ying Fang Kao, 2011. "Herbert A. Simon," ASSRU Discussion Papers 1115, ASSRU - Algorithmic Social Science Research Unit.
More about this item
KeywordsP vs. NP ; allocation problem; assignment problem; traveling salesman; exact solution for NP problems; approximate solutions for NP problems; undecidability; incompleteness;
NEP fieldsThis paper has been announced in the following NEP Reports:
StatisticsAccess and download statistics
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: (email@example.com). General contact details of provider: http://edirc.repec.org/data/detreit.html .