Change search
ReferencesLink to record
Permanent link

Direct link
Treewidth and Indexicals: Applying Results in Tractability to Propagators
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2016 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

I simplify a small part of tractability research in the field of time complexity in constraint programming. Treewidth and strong k-consistency can be combined in order to achieve tractability. The result is partially applied to Extended Indexicals by implementing treewidth in Extended Indexicals. Preliminary tests of the treewidth of the most common constraints have been carried out and the result is promising with the majority of the constraints having a low treewidth.

Place, publisher, year, edition, pages
2016. , 26 p.
IT, 16030
National Category
Engineering and Technology
URN: urn:nbn:se:uu:diva-296882OAI: diva2:940052
Available from: 2016-06-20 Created: 2016-06-20 Last updated: 2016-06-20Bibliographically approved

Open Access in DiVA

fulltext(521 kB)13 downloads
File information
File name FULLTEXT01.pdfFile size 521 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 13 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 31 hits
ReferencesLink to record
Permanent link

Direct link