Semantisches Browsen
Aus International Center for Computational Logic
The forbidden patterns problem of the set … The forbidden patterns problem of the set of vertex-coloured graphs {H1,…,Hk} is the decision problem of the form: given a finite graph G as input, is it possible to colour the vertices of G in a way that none of H1, …, Hk homomorphically maps to the resulting coloured graph. The logic MMSNP can be seen as a complexity class whose problems are forbidden patterns problems of finite sets of coloured relational structures. It was conjectured by Feder and Vardi that this complexity class exhibits a complexity dichotomy (i.e., that every forbidden patterns problem is in P or NP-complete). Feder and Vardi showed that every problem in MMSNP reduces in probabilistic polynomial-time to the CSP of a structure with finite domain, and Kun later derandomized this reduction. Thus, MMSNP and finite-domain CSPs are computationally equivalent.</br></br></br>Following up on Manuel's talk, I will present a completely new reduction from MMSNP to finite-domain CSPs that uses recent techniques and results from universal algebra, model theory, and Ramsey theory. This proves a stronger form of the Feder-Vardi-Kun result, and shows in particular that the Bodirsky-Pinsker tractability conjecture holds for all CSPs in MMSNP.ty conjecture holds for all CSPs in MMSNP. +
The forbidden patterns problem of the set … The forbidden patterns problem of the set of vertex-coloured graphs {H1,…,Hk} is the decision problem of the form: given a finite graph G as input, is it possible to colour the vertices of G in a way that none of H1, …, Hk homomorphically maps to the resulting coloured graph. The logic MMSNP can be seen as a complexity class whose problems are forbidden patterns problems of finite sets of coloured relational structures. It was conjectured by Feder and Vardi that this complexity class exhibits a complexity dichotomy (i.e., that every forbidden patterns problem is in P or NP-complete). Feder and Vardi showed that every problem in MMSNP reduces in probabilistic polynomial-time to the CSP of a structure with finite domain, and Kun later derandomized this reduction. Thus, MMSNP and finite-domain CSPs are computationally equivalent.</br></br></br>Following up on Manuel's talk, I will present a completely new reduction from MMSNP to finite-domain CSPs that uses recent techniques and results from universal algebra, model theory, and Ramsey theory. This proves a stronger form of the Feder-Vardi-Kun result, and shows in particular that the Bodirsky-Pinsker tractability conjecture holds for all CSPs in MMSNP.ty conjecture holds for all CSPs in MMSNP. +
Datum„Datum <span style="font-size:small;">(Date)</span>“ ist ein <a href="/web/Spezial:Datentypen/Date" title="Spezial:Datentypen/Date">Datentyp</a> für Datumswerte. Er wird Attributen mit Hilfe eines von <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Special_properties">Semantic MediaWiki</a> bereitgestellten, softwareseitig fest definierten Attributs (Spezialattribut), zugeordnet.
1. September 2017, 13:45:00 +
Vortrag +
Antoine Mottet +
Anzeigetitel„Anzeigetitel <span style="font-size:small;">(Display title of)</span>“ ist ein softwareseitig fest definiertes Attribut, das einen eindeutigen Anzeigetitel zu einem Objekt speichert und ihm zuweist. Es wird von <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Special_properties">Semantic MediaWiki</a> zur Verfügung gestellt.
Monotone Monadic SNP 2: Proof of the Universal-algebraic Dichotomy Conjecture +
Zuletzt geändert„Zuletzt geändert <span style="font-size:small;">(Modification date)</span>“ ist ein softwareseitig fest definiertes Attribut, das das Datum der letzten Änderung einer Seite speichert. Es wird von <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Special_properties">Semantic MediaWiki</a> zur Verfügung gestellt.
25. August 2017, 07:16:41 +
Hat Abfrage„Hat Abfrage <span style="font-size:small;">(Has query)</span>“ ist ein softwareseitig fest definiertes Attribut, das die Metainformationen einer Abfrage als <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Subobject">Subobjekt</a> speichert. Es wird von <a rel="nofollow" class="external text" href="https://www.semantic-mediawiki.org/wiki/Help:Special_properties">Semantic MediaWiki</a> zur Verfügung gestellt.
Keine Attribute verlinken auf diese Seite.
