A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)
Abstract
References
Index Terms
- A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)
Recommendations
#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes
In this work, we study two simple yet general complexity classes, based on logspace Turing machines, that provide a unifying framework for efficient query evaluation in areas such as information extraction and graph databases, among others. We investigate ...
Pseudorandomness for Approximate Counting and Sampling
We study computational procedures that use both randomness and nondeterminism. The goal of this paper is to derandomize such procedures under the weakest possible assumptions.
Our main technical contribution allows one to "boost" a given hardness ...
Fine-grained reductions from approximate counting to decision
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingIn this paper, we introduce a general framework for fine-grained reductions of approximate counting problems to their decision versions. (Thus we use an oracle that decides whether any witness exists to multiplicatively approximate the number of ...
Comments
Information & Contributors
Information
Published In
- General Chair:
- Samir Khuller,
- Program Chair:
- Virginia Vassilevska Williams
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Abstract
Funding Sources
- ANID - Millennium Science Initiative Program - Chile
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigact
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 193Total Downloads
- Downloads (Last 12 months)14
- Downloads (Last 6 weeks)2
Other Metrics
Citations
Media
Figures
Other
Tables
Get Access
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in