What makes a problem GP-hard? Validating a hypothesis of structural causes

DOI10.1007/3-540-45110-2_60MaRDI QIDQ4449785zbMATH OpenFDO

Authors Jason M. Daida, Hsiaolei Li, Ricky Tang, Adam M. Hilss

Publication date 11 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2724/27241665.htm

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
• Causes and explanations in the structural-model approach: Tractable cases
• The computational complexity of structure-based causality
• Inferring causal relations by modelling structures
• Model structures and structural identifiability: what? why? how?
• Complexity results for explanations in the structural-model approach
• scientific article; zbMATH DE number 5198648
• scientific article; zbMATH DE number 1199860

Cited in

(2)

• Uncertain decision tree for bank marketing classification
• What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming

Describes a project that uses

Uses Software

• MersenneTwister

This page was built for publication: What makes a problem GP-hard? Validating a hypothesis of structural causes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449785)