info:oai:cogprints.org:457info:ofi/fmt:xml:xsd:oai_dc
Representation operators and computation
Kitts, B.
Artificial Intelligence
Complexity Theory
Machine Learning
This paper derives results about the impact of representation and search operators on the Computational Complexity of a problem. A model of computation is introduced based on a directed graph structure, and representation and search are defined to be the vertices and edges of the graph respectively. Changing either the representation or the search algorithm leads to different possible graphs, and hence different complexity classes. The final section explores the role of representation in reducing time complexity in Artificial Intelligence.
1998
Preprint
NonPeerReviewed
application/postscript
http://cogprints.org/457/2/duality2.ps
Kitts, B. (1998) Representation operators and computation. [Preprint] (Unpublished)
http://cogprints.org/457/