Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5156628> ?p ?o }
Showing triples 1 to 35 of
35
with 100 triples per page.
- Q5156628 subject Q8415876.
- Q5156628 abstract "The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction problems on finite domains.Solving a constraint satisfaction problem on a finite domain is an NP-complete problem in general. Research has shown a number of polynomial-time subcases, mostly obtained by restricting either the allowed domains or constraints or the way constraints can be placed over the variables. Research has also established relationship of the constraint satisfaction problem with problems in other areas such as finite model theory and databases.".
- Q5156628 wikiPageExternalLink index.html.
- Q5156628 wikiPageWikiLink Q10361123.
- Q5156628 wikiPageWikiLink Q1128326.
- Q5156628 wikiPageWikiLink Q1130846.
- Q5156628 wikiPageWikiLink Q1172264.
- Q5156628 wikiPageWikiLink Q141488.
- Q5156628 wikiPageWikiLink Q17143897.
- Q5156628 wikiPageWikiLink Q174733.
- Q5156628 wikiPageWikiLink Q185521.
- Q5156628 wikiPageWikiLink Q2003535.
- Q5156628 wikiPageWikiLink Q205084.
- Q5156628 wikiPageWikiLink Q215111.
- Q5156628 wikiPageWikiLink Q215206.
- Q5156628 wikiPageWikiLink Q230655.
- Q5156628 wikiPageWikiLink Q272735.
- Q5156628 wikiPageWikiLink Q278425.
- Q5156628 wikiPageWikiLink Q3407510.
- Q5156628 wikiPageWikiLink Q4596967.
- Q5156628 wikiPageWikiLink Q4809258.
- Q5156628 wikiPageWikiLink Q4913885.
- Q5156628 wikiPageWikiLink Q504843.
- Q5156628 wikiPageWikiLink Q5164372.
- Q5156628 wikiPageWikiLink Q5164379.
- Q5156628 wikiPageWikiLink Q5249566.
- Q5156628 wikiPageWikiLink Q5450405.
- Q5156628 wikiPageWikiLink Q5516347.
- Q5156628 wikiPageWikiLink Q7430892.
- Q5156628 wikiPageWikiLink Q8415876.
- Q5156628 wikiPageWikiLink Q846354.
- Q5156628 wikiPageWikiLink Q8513.
- Q5156628 wikiPageWikiLink Q875276.
- Q5156628 comment "The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction problems on finite domains.Solving a constraint satisfaction problem on a finite domain is an NP-complete problem in general.".
- Q5156628 label "Complexity of constraint satisfaction".