16 citations · 25 across the 14 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021★ 1 cited
Model Counting meets F0 Estimation
A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya +1
Constraint satisfaction problems (CSP's) and data stream models are two powerful abstractions to capture a wide variety of problems arising in different domains of computer science…
cs.CC2021
Promise Problems Meet Pseudodeterminism
Peter Dixon, A. Pavan, N. V. Vinodchandran
The Acceptance Probability Estimation Problem (APEP) is to additively approximate the acceptance probability of a Boolean circuit. This problem admits a probabilistic approximation…