Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence
Summary: Proposes a practical FPRAS for #NFA with time O(n^2 m^3 log(nm) eps^-2 log(delta^-1)). Sub-quadratic membership checks (O(n m^2)) enable tractable counting of length-n words accepted by NFAs, addressing impractical prior FPRAS. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Kuldeep S. Meel (Georgia Institute of Technology; University of Toronto)
- 2. Alexis de Colnet (Vienna University of Technology)
BibTeX Citation
@inproceedings{meel_pods25,
address = {New York, NY, USA},
series = {{PODS} '25},
title = {{Towards Practical FPRAS for \#NFA: Exploiting the Power of Dependence}},
url = {https://dl.acm.org/doi/10.1145/3725253},
doi = {10.1145/3725253},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Meel, Kuldeep S. and de Colnet, Alexis},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,472 | Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | PODS | 7.3870922e-05 |
| 7,317 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS | 5.6466593e-05 |
| 11,139 | A faster FPRAS for #NFA | 2024 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,924 | Efficient Enumeration for Annotated Grammars | 2022 | PODS |
| 2 | 5,346 | Running Tree Automata on Probabilistic XML | 2009 | PODS |
| 3 | 12,299 | Deterministic Regular Expressions in Linear Time | 2012 | PODS |
| 4 | 10,636 | A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity | 2025 | PODS |
| 5 | 8,241 | Counting Database Repairs Entailing a Query: The Case of Functional Dependencies | 2022 | PODS |
| 6 | 7,317 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS |
| 7 | 5,579 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS |
| 8 | 9,036 | Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations | 2022 | PODS |
| 9 | 3,472 | Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | PODS |
| 10 | 11,139 | A faster FPRAS for #NFA | 2024 | PODS |