Extent: | 1 online resource (22 pages) |
---|---|
Series: | IMF working paper ; WP/09/24 |
Type of publication: | Book / Working Paper |
Language: | English |
Notes: | Description based on publisher supplied metadata and other sources. Contents; I. Introduction; II. Is Computing Equilibria Difficult?; Table; 1. Payoff Matrix for the Prisoner's Dilemma; Figures; 1. NP-complete: Is there a Hamilton Cycle?; 2. P: Is this a Hamilton Cycle?; III. Are There Natural Problems with No Best Algorithm?; A. Superlinear vs. Blum Speedup; B. No Best Algorithm for Integer and Matrix Multiplication?; 3. Boolean circuit: Are at least two inputs "TRUE"?; C. The Power of Cancellation; D. No Best Algorithm for coNP-Complete Problems?; E. No Best Algorithm Versus No Algorithm at All; IV. Conclusion; 4. Is speedup inherited?; References |
ISBN: | 978-1-4519-1607-2 ; 978-1-4518-7171-5 ; 978-1-4518-7171-5 |
Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012684880