Sharpened and Focused No Free Lunch and Complexity Theory

Darrell Whitley
Additional contact information
Darrell Whitley: Colorado State University

Chapter Chapter 16 in Search Methodologies, 2014, pp 451-476 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:

Keywords: Search Space; Search Algorithm; Polynomial Time; Turing Machine; Travel Salesman Problem (search for similar items in EconPapers)
Date: 2014
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-1-4614-6940-7_16

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

DOI: 10.1007/978-1-4614-6940-7_16

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 ().