4940 search results - page 69 / 988 » On the Complexity of Universal Programs |
139
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
163
click to vote
TIT
2010
14 years 11 months ago
2010
The significant and meaningful fraction of all the potential information residing in the molecules and structures of living systems is unknown. Sets of random molecular sequences o...
120
click to vote
APAL
2006
15 years 4 months ago
2006
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
131
click to vote
ACTA
2004
15 years 4 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
124
click to vote
ESEM
2009
ACM
15 years 10 months ago
2009
ACM
Despite the critical role of software modifiability, it has no universally accepted measurement model. Measuring modifiability in terms of maintenance effort is problematic becaus...