@phdthesis{Meister2006,
  author    = {Meister, Daniel},
  title     = {The complexity of membership problems for finite recurrent systems and minimal triangulations},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-18837},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2006},
  abstract  = {The dissertation thesis studies the complexity of membership problems. Generally, membership problems consider the question whether a given object belongs to a set. Object and set are part of the input. The thesis studies the complexity of membership problems for two special kinds of sets. The first problem class asks whether a given natural number belongs to a set of natural numbers. The set of natural numbers is defined via finite recurrent systems: sets are built by iterative application of operations, like union, intersection, complementation and arithmetical operations, to already defined sets. This general problem implies further problems by restricting the set of used operations. The thesis contains completeness results for well-known complexity classes as well as undecidability results for these problems. The second problem class asks whether a given graph is a minimal triangulation of another graph. A graph is a triangulation of another graph, if it is a chordal spanning supergraph of the second graph. If no proper supergraph of the first graph is a triangulation of the second graph, the first graph is a minimal triangulation of the second graph. The complexity of the membership problem for minimal triangulations of several graph classes is investigated. Restricted variants are solved by linear-time algorithms. These algorithms rely on appropriate characterisations of minimal triangulations.},
  subject      = {Komplexit{\"a}t},
  language  = {en}
}