Constraint Satisfaction Problems: Convexity Makes All Different Constraints 
Tractable

Fellows, Michael R.; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances A.

doi:10.5591/978-1-57735-516-8/IJCAI11-095

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable

MPS-Authors

/persons/resource/persons44447

Friedrich, Tobias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44612

Hermelin, Danny
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Fellows, M. R., Friedrich, T., Hermelin, D., Narodytska, N., & Rosamond, F. A. (2011). Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable. In T. Walsh (Ed.), Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (pp. 522-527). Menlo Park, CA: AAAI Press. doi:10.5591/978-1-57735-516-8/IJCAI11-095.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-1209-4

Abstract

There is no abstract available