The no free lunch theorems: Complexity and security

IEEE Transactions on Automatic Control

Volumn 48, Issue 5, 2003, Pages 783-793

  Ho, Yu Chi ^a,b   Zhao, Qian Chuan ^b   Pepyne, David L ^a,b  

^a HARVARD UNIVERSITY   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Complexity; No Free Lunch Theorem; Optimization; Security

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; INFORMATION MANAGEMENT; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; THEOREM PROVING;

FREE LUNCH THEOREMS;

HUMAN ENGINEERING;

EID: 0037955677     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2003.811254     Document Type: Article

References (20)

1. G.C. Calafiore, F. Dabbene, and R. Tempo, "Randomized algorithms for probabilistic robustness with real and complex structured uncertainty," IEEE Trans. Automat. Contr., vol. 45, pp. 2218-2235, Dec. 2000.
2. J. M. Carlson and J. Doyle, "Highly optimized tolerance: robustness and design in complex systems," Phys. Rev. Lett., vol. 84, no. 11, pp. 2529-2532, Mar. 13, 2000.
3. D.-Z Du and K.-I. Ko, Theory of Computational Complexity. New York: Wiley, 2000.
4. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification, 2nd ed. New York, NY: Wiley, 2001.
5. B. Greene, The Elegant Universe Norton, New York, 1999.
6. L. K. Grover, "A fast quantum mechanical algorithm for data search," in Proc. ACM Symp. Theory Computing, 1996, pp. 212-219.
7. Y. C. Ho and D. L. Pepyne, "Simple explanation of the No Free Lunch Theorem and its implications," J. Optim. Theory Applicat., vol. 115, no. 3, Dec. 2002.
8. _, "Simple explanation of the No Free Lunch Theorem of optimization," presented at the 2001 IEEE Conf. Decision Control, Tampa, FL, Dec. 2001.
9. S. Johnson, Emergence. New York: Scribner, 2001.
10. J. Levin, How the Universe Cot Its Spots. Princeton, NJ: Princeton Univ. Press, 2002.
11. X.-C. Lin, "A new framework for discrete stochastic optimization," Ph.D. dissertation, Div. Eng. Appl. Sci., Harvard Univ., Cambridge, MA, 2000.
12. S. Lloyd, "Measures of complexity: a nonexhaustive list," IEEE Control Syst. Mag., vol. 21, pp. 7-8, Aug. 2001.
13. R. K. Merton, "The unanticipated consequences of purposive social action," Amer. Sociolog. Rev., vol. 1, no. 6, Dec. 1936.
14. M. O. Rabin, "Probabilistic algorithm for testing primality," J. Number Theory, vol. 12, pp. 128-138, 1980.
15. _, "Probabilistic algorithms," in Algorithms and Complexity: New Directions and Recent Trends, J. F. Traub, Ed. New York: Academic, 1976, pp. 21-39.
16. F. T. Vertosick, The Genius Within. New York: Harcourt, 2002.
17. M. M. Waldrop, Complexity: The Emerging Science at the Edge of Order and Chaos. New York: Simon and Schuster, 1992.
18. C. P. Williams and S. H. Clearwater, Explorations in Quantum Computing. New York: Springer-Verlag, 1997.
19. D. H. Wolpert and W. G. Macready, "No Free Lunch Theorems for optimization," IEEE Trans. Evolut. Comput., vol. 1, pp. 67-82, Apr. 1997.
20. _, "No Free Lunch theorems for search," Santa Fe Institute, Santa Fe, NM, Tech. Rep. SFI-TR-95-02-010, 1995.