<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06113538</id>
  <dt>j</dt>
  <an>06113538</an>
  <augroup>
    <au>Bova, Simone</au>
    <au>Chen, Hubie</au>
    <au>Valeriote, Matthew</au>
  </augroup>
  <ti>On the expression complexity of equivalence and isomorphism of primitive positive formulas.</ti>
  <so>Theory Comput. Syst. 50, No. 2, 329-353 (2012).</so>
  <py>2012</py>
  <pu>Springer-Verlag, New York, NY</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>primitive positive formulas</ut>
    <ut>equivalence</ut>
    <ut>isomorphism</ut>
    <ut>computational complexity</ut>
    <ut>clones</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s00224-010-9302-7</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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.</ab>
    <rv></rv>
  </abgroup>
</item>