Incremental graph evaluation (attribute grammar)
Incremental graph evaluation (attribute grammar)
An incremental constraint solver
Communications of the ACM
Using constraints for user interface construction
Using constraints for user interface construction
Constraint satisfaction and debugging for interactive user interfaces
Constraint satisfaction and debugging for interactive user interfaces
An incremental algorithm for satisfying hierarchies of multiway dataflow constraints
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Polynomial Time Local Propagation Algorithm for General Dataflow Constraint Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Property models: from incidental algorithms to reusable components
GPCE '08 Proceedings of the 7th international conference on Generative programming and component engineering
Algorithms for user interfaces
GPCE '09 Proceedings of the eighth international conference on Generative programming and component engineering
Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
| Hi-index | 0.00 |
Although it is acknowledged that multiway dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain local propagation algorithms that solve these constraints are polynomial, others (such as Sky-Blue) are exponential. Every system handles a specific problem and the influence of any particular restriction on the computational complexity is not yet precisely determined. In this paper, we present three theoretical results that allow us to classify existing multi-way constraint problems. Especially, we prove that the problem handled by SkyBlue is NP-hard.