-------- Original Message -------- Subject: Questions about complexity in PPL Date: Wed, 22 Aug 2007 18:20:18 +0200 From: Florent Bouchy <florent.bouchy@gmail.com> To: bagnara@cs.unipr.it Hi, first of all, thanks for PPL, which I am currently using in my PhD. I would like to know the complexity of some operations in PPL : intersection, union, and difference of 2 sets, and the emptiness test of a set. Could you please give me a rough algorithmical complexity, or a reference to a paper/presentation detailing them ? Thanks in advance ! -- Florent Bouchy LSV, ENS Cachan & CNRS -- Prof. Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it