Database Paper Browser

Back to papers

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)

Paper ID
1987
Venue
PODS
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,362 | 27.92%
DOI
10.1145/3725253

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 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
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
10,918 A faster FPRAS for #NFA 2024 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers