Papers

Topics

Authors

Recent

View all

Detailed Answer

Quick Answer

Concise responses based on abstracts only

Detailed Answer

Well-researched responses based on abstracts and relevant paper content.

Custom Instructions Pro

Preferences or requirements that you'd like Emergent Mind to consider when generating responses

Gemini 2.5 Flash

Gemini 2.5 Flash 39 tok/s

Gemini 2.5 Pro 49 tok/s Pro

GPT-5 Medium 12 tok/s Pro

GPT-5 High 18 tok/s Pro

GPT-4o 91 tok/s Pro

Kimi K2 191 tok/s Pro

GPT OSS 120B 456 tok/s Pro

Claude Sonnet 4 37 tok/s Pro

2000 character limit reached

Computational Complexity Results for Genetic Programming and the Sorting Problem (1103.5797v2)

Published 29 Mar 2011 in cs.NE

Abstract: Genetic Programming (GP) has found various applications. Understanding this type of algorithm from a theoretical point of view is a challenging task. The first results on the computational complexity of GP have been obtained for problems with isolated program semantics. With this paper, we push forward the computational complexity analysis of GP on a problem with dependent program semantics. We study the well-known sorting problem in this context and analyze rigorously how GP can deal with different measures of sortedness.

Citations (2)

View on Semantic Scholar