A Model for Donation Verification
Abstract
In this paper, we introduce a model for donation verification. A randomized algorithm is developed to check if the money claimed being received by the collector is (1-ε)-approximation to the total amount money contributed by the donors. We also derive some negative results that show it is impossible to verify the donations under some circumstances.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.