On the complexity of enumerating pseudo-intents

  • Authors:

  • Felix Distel;Barış Sertkaya

  • Affiliations:

  • Theoretical Computer Science, TU Dresden, Nöthnitzer Str. 46 01187 Dresden, Germany;SAP Research Center Dresden, Chemtnitzer Str. 48 01187 Dresden, Germany

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2011

Quantified Score

Hi-index 0.05

Visualization

Abstract

We investigate whether the pseudo-intents of a given formal context can efficiently be enumerated. We show that they cannot be enumerated in a specified lexicographic order with polynomial delay unless P=NP. Furthermore we show that if the restriction on the order of enumeration is removed, then the problem becomes at least as hard as enumerating minimal transversals of a given hypergraph. We introduce the notion of minimal pseudo-intents and show that recognizing minimal pseudo-intents is polynomial. Despite their less complicated nature, surprisingly it turns out that minimal pseudo-intents cannot be enumerated in output-polynomial time unless P=NP.