4940 search results - page 152 / 988 » On the Complexity of Universal Programs |
127
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
143
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
139
click to vote
ACSD
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
119
Voted
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
126
Voted
ICSE
1998
IEEE-ACM
15 years 9 months ago
1998
IEEE-ACM
Consistency management is an important requirement in many complex applications, but current programming languages and database systems provide inadequate support for it. To addre...