Complexity Theory and the No Free Lunch Theorem

Darrell Whitley and Jean Paul Watson
Additional contact information
Darrell Whitley: Colorado State University, Department of Computer Science
Jean Paul Watson: Sandia National Laboratories

Chapter Chapter 11 in Search Methodologies, 2005, pp 317-339 from Springer

Abstract: Abstract This tutorial reviews basic concepts in complexity theory, as well as various No Free Lunch results and how these results relate to computational complexity. The tutorial explains basic concepts in an informal fashion that illuminates key concepts. No Free Lunch theorems for search can be summarized by the following result: For all possible performance measures, no search algorithm is better than another when its performance is averaged over all possible discrete functions.

Keywords: Search Space; Search Algorithm; Polynomial Time; Turing Machine; Travel Salesman Problem (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-28356-2_11

Ordering information: This item can be ordered from
http://www.springer.com/9780387283562

DOI: 10.1007/0-387-28356-0_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().