2000 character limit reached
Modular Runtime Complexity Analysis of Probabilistic While Programs (1908.11343v1)
Published 23 Aug 2019 in cs.PL and cs.LO
Abstract: We are concerned with the average case runtime complexity analysis of a prototypical imperative language endowed with primitives for sampling and probabilistic choice. Taking inspiration from known approaches from to the modular resource analysis of non-probabilistic programs, we investigate how a modular runtime analysis is obtained for probabilistic programs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.