570 search results - page 39 / 114 » The Complexity of Reasoning with Global Constraints |
CP
2005
Springer
15 years 3 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
102
click to vote
CSL
2003
Springer
15 years 2 months ago
2003
Springer
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
The design of complex Systems-on-Chips implies to take into account communication and memory access constraints for the integration of dedicated hardware accelerator. In this paper...
112
click to vote
ADBIS
2006
Springer
15 years 1 months ago
2006
Springer
Among the most important expected benefits of a global service oriented architecture leveraging web service standards is an increased level of automation in the discovery, composit...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...