Representation operators and computationB.KittsauthorThis 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.Artificial IntelligenceComplexity TheoryMachine Learning1998Preprint