Database Paper Browser

Back to papers

A faster FPRAS for #NFA

Summary: Presents a faster FPRAS for #NFA, reducing per-state samples to polylog(m) and Õ(n^4/ε^2); time is Õ((m^2 n^10 + m^3 n^6)/ε^4 · log^2(1/δ)). Uses weaker invariants and total-variation closeness to uniform, pushing toward practical approximate #NFA tools. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1942
Venue
PODS
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,918 | 24.05%
DOI
10.1145/3651613

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,362 Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence 2025 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2,293 Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation 2019 PODS 9.0899933e-05
7,163 Probabilistic Query Evaluation: The Combined FPRAS Landscape 2023 PODS 4.8132033e-05
Previous Page 1 / 1 Next

Semantically Similar Papers