Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 59-73, 2019.
counting enumeration uniform generation.
In this work, we study two simple yet general complexity classes, based on logspace Turing machines, which provide a unifying framework for efficient query evaluation in areas like information extraction and graph databases, among others. We investigate the complexity of three fundamental algorithmic problems for these classes: enumeratio...More
Full Text (Upload PDF)
Best Paper of PODS, 2019