4940 search results - page 117 / 988 » On the Complexity of Universal Programs |
153
click to vote
CSR
2008
Springer
15 years 4 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
164
Voted
SIAMDM
2010
15 years 3 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
133
Voted
ICDT
2009
ACM
15 years 11 months ago
2009
ACM
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
121
Voted
SYNASC
2005
IEEE
15 years 10 months ago
2005
IEEE
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
126
click to vote
ECIS
2004
15 years 6 months ago
2004
Discursive-based analysis of organizations is not new in the field of interpretive social studies. Since not long ago have information systems (IS) studies also shown a keen inter...