See this document in CiteSeerX!

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



  Home/Search   Context   Related

 
View or download:
sop.inria.fr/cermics/co...ijcai97.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 acknowledged that multi-way 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 SkyBlue) 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... (Update)

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

Active bibliography (related documents):   More   All
0.6:   Links for Boosting Predictable Interactive Constraint Systems - Trombettoni, Neveu   (Correct)
0.1:   An Incremental Algorithm for Satisfying Hierarchies of Multi-way, .. - Zanden (1995)   (Correct)
0.1:   Theoretical Properties and Efficient Satisfaction of Hierarchical .. - Hosobe (1997)   (Correct)

Similar documents based on text:   More   All
0.4:   New Light on Arc-Consistency over Continuous Domains - Chabert, Trombettoni, Neveu   (Correct)
0.4:   Using Graph Decomposition for Solving Continuous CSPs - Bliek, Neveu, Trombettoni (1998)   (Correct)
0.4:   A Constraint Programming Approach for Solving Rigid .. - Jermann.. (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ trombettoni-computational,
  author = "Gilles Trombettoni and Bertrand Neveu",
  title = "Computational Complexity of Multi-way, Dataflow Constraint Problems",
  url = "citeseer.ist.psu.edu/167379.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
64   Sketchpad: A ManMachine Graphical Communication System (context) - Sutherland - 1963
29   An incremental algorithm for satisfying hierarchies of multi.. - Zanden - 1996
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
2   Computational complexity of multiway (context) - Trombettoni, Neveu - 1997

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