See this document in CiteSeerX!

Computational Complexity of Multi-way, Dataflow Constraint Problems (1997)  (Make Corrections)  
Gilles Trombettoni, Bertrand Neveu
IJCAI (1)



  Home/Search   Context   Related

 
View or download:
sop.inria.fr/cermi...ermics9786.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  inria.fr/cermics/c...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Although it is widely acknowledged that multi-way dataflow constraints make it easier to specify certain relationships in interactive applications, concerns about their efficiency have impeded their acceptance. Some of the local propagation algorithms that solve these constraints are polynomial, others (such as SkyBlue) are exponential. In fact, every system handles a specific problem and the influence of any particular restriction on the computational complexity is not yet precisely... (Update)

Similar documents (at the sentence level):
36.0%:   Computational Complexity of Multi-way, Dataflow Constraint.. - Trombettoni, Neveu   (Correct)

Active bibliography (related documents):   More   All
0.1:   An Incremental Algorithm for Satisfying Hierarchies of Multi-way, .. - Zanden (1995)   (Correct)
0.1:   Multi-way versus One-way Constraints in User.. - Sannella.. (1993)   (Correct)
0.1:   Hierarchical Constraint Logic Programming - Wilson, Borning (1993)   (Correct)

Similar documents based on text:   More   All
0.4:   Multiway Cuts in Directed and Node Weighted Graphs - Garg, Vazirani, Yannakakais (1994)   (Correct)
0.4:   Asynchrony in parallel computing: From dataflow to.. - Silc, Robic, Ungerer (1997)   (Correct)
0.4:   Multiway Partitioning with Pairwise Movement - Cong, Lim (1998)   (Correct)

BibTeX entry:   (Update)

@inproceedings{ trombettoni97computational,
    author = "Gilles Trombettoni and Bertrand Neveu",
    title = "Computational Complexity of Multi-way, Dataflow Constraint Problems",
    booktitle = "{IJCAI} (1)",
    pages = "358--365",
    year = "1997",
    url = "citeseer.ist.psu.edu/article/trombettoni97computational.html" }
Citations (may not include all citations):
150   Computational Complexity (context) - Papadimitriou - 1994
100   An incremental constraint solver (context) - Freeman-Benson, Maloney et al. - 1990
96   Lisp and Symbolic Computation (context) - Borning, Freeman-Benson et al. - 1992
64   Sketchpad: A Man-Machine Graphical Communication System (context) - Sutherland - 1963
26   Using Constraints for User Interface Construction (context) - Maloney - 1991
24   Incremental Graph Evaluation (context) - Hoover - 1987
18   Constraint Satisfaction and Debugging for Interactive User I.. (context) - Sannella - 1994
18   Constraint programming and graph algorithms (context) - Gangnet, Rosenberg - 1992

Documents on the same site (http://www.inria.fr/cermics/contraintes/publications.html):   More
Self Adapting Crossover Operator for CSP - Riff-Rojas   (Correct)
Filtrage De Problemes Par Consistance De Chemin Restreinte - Berlandier   (Correct)
A Non-diffident Combinatorial Optimization Algorithm - Trombettoni, Neveu..   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC