Succinctness and tractability of closure operator representations

Sebastian Rudolph. Succinctness and tractability of closure operator representations. Theoretical Computer Science, 658:327-345, 2017. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.