License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-23690
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2369/
Valeriote, Matt ; Bova, Simone ; Chen, Hubie

On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas

pdf-format:
Dokument 1.pdf (396 KB)

Abstract

We study the complexity of equivalence and isomorphism on primitive positive formulas with respect to a given structure. We study these problems for various fixed structures; we present generic hardness and complexity class containment results, and give classification theorems for the case of two-element (boolean) structures.

BibTeX - Entry

@InProceedings{valeriote_et_al:DSP:2010:2369,
  author =	{Matt Valeriote and Simone Bova and Hubie Chen},
  title =	{On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas},
  booktitle =	{The Constraint Satisfaction Problem: Complexity and Approximability},
  year =	{2010},
  editor =	{Andrei A. Bulatov and Martin Grohe and Phokion G. Kolaitis and Andrei Krokhin},
  number =	{09441},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2369},
  annote =	{Keywords: Expression complexity, equivalence, isomorphism, primitive positive formulas}
}

Keywords: Expression complexity, equivalence, isomorphism, primitive positive formulas
Seminar: 09441 - The Constraint Satisfaction Problem: Complexity and Approximability
Issue date: 2010
Date of publication: 07.01.2010

DROPS-Home | Fulltext Search | Imprint Published by LZI