no code implementations • 8 Jun 2015 • Paul Beame, Vincent Liew
We use this relationship to prove exponential lower bounds on the SDD size for representing a large class of problems that occur naturally as queries over probabilistic databases.
