Skip to content Skip to footer
  • Researchers (public profile)
  • Research output
  • Projects
  • Units
  • Datasets
  • Activities
  • Journals
  • Prizes
  • Courses
  • Statistics
  • Facilities/Equipment
  • Press/Media
  •  English
  •  German
Website of TUD Dresden University of Technology
  • FIS Login
FIS logo

Research Portal of the TU Dresden

  •  Home
  • Research output
  • Succinctness and tractability of closure operator representa...

Succinctness and tractability of closure operator representations.

Research output: Contribution to journal › Research article › Contributed › peer-review

Contributors

  • Sebastian Rudolph - , Chair of Computational Logic (Author)

Details

Original languageEnglish
Pages (from-to)327-345
Number of pages19
JournalTheoretical computer science : the journal of the EATCS
Volume658
Publication statusPublished - 2017
Peer-reviewedYes

External IDs

Scopus 84952917070

Keywords

Altmetric Attention Score

DOI

  • https://doi.org/10.1016/j.tcs.2015.12.028

    Final published version

Links

Links

  • https://dblp.org/db/journals/tcs/tcs658.html#Rudolph17
  • https://www.wikidata.org/entity/Q54824445

Other links

  • Link to publication in Scopus
Research Portal of TU Dresden
  • Contact
  • FAQ
  •  Twitter
  •  Facebook
  •  Youtube
  •  Instagram
TU Dresden is co-financed by tax funds using the budget approved by the Landtag of the Free State of Saxony.
  • Legal notice
  • Privacy
  • Accessibility