457
10
10597
2
42956
document
10597
duality2.ps
application/postscript
170864
20091208 20:31:03
http://cogprints.org/457/2/duality2.ps
457
2
2
application/postscript
application/postscript
public
duality2.ps

http://eprints.org/relation/hasVolatileVersion
http://cogprints.org/id/document/4737

http://eprints.org/relation/haspreviewThumbnailVersion
http://cogprints.org/id/document/4737

http://eprints.org/relation/hasVersion
http://cogprints.org/id/document/4737
archive
203
disk0/00/00/04/57
19980614
20110311 08:53:58
20070912 16:28:15
preprint
show
0
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.
 http://www.cs.brandeis.edu/~brendy

Kitts
B.
unpub
representation recoding redescription
FALSE
FALSE
 compsciartintel
 compscicomplextheory
 compscimachlearn
Representation operators and computation
published
1998
public