4940 search results - page 428 / 988 » On the Complexity of Universal Programs |
174
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
204
click to vote
ICMT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
188
click to vote
IEEEICCI
2007
IEEE
16 years 1 months ago
2007
IEEE
Shao and Wang have proposed a cognitive complexity measure[8] as a metric that can be used for estimating the comprehension effort for understanding software written in imperative...
198
click to vote
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
158
click to vote
IWEC
2004
15 years 8 months ago
2004
With the increase of computer capabilities, many learning systems have become complex simulators with advanced interfaces close to game quality. However, many games features have n...