-------- Original Message -------- Subject: Re: Questions about complexity in PPL Date: Thu, 04 Oct 2007 18:03:37 +0200 From: Florent Bouchy <florent.bouchy@lsv.ens-cachan.fr> Organization: LSV - CNRS & ENS Cachan To: bagnara@cs.unipr.it References: <f8d1c6290708220920s3063e66eh21b8bf3a01b4a391@mail.gmail.com> <4704B468.30107@cs.unipr.it> <f8d1c6290710040515q2caaed95n31475b9c1556af50@mail.gmail.com> From: Roberto Bagnara <bagnara@cs.unipr.it> Date: Oct 4, 2007 11:37 AM Subject: Re: Questions about complexity in PPL To: Florent Bouchy <florent.bouchy@gmail.com> Cc: The Parma Polyhedra Library developers' list <ppl-devel@cs.unipr.it>

...

first of all, thanks for PPL, which I am currently using in my PhD.

We are glad you appreciate it. In which application are you using the PPL?

I am trying to represent larger sets of real vectors, by combining PPL with arithmetically-defined integer sets. I'm working on a paper with Alain Finkel and Jerome Leroux, so I'll be able to give you some feedback about this work in a few weeks if you wish.

...

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 ?

We have just added a FAQ page to the PPL web site. Please check if this answers your question. If not, please do not hesitate to come back to us (this time we will answer very quickly :-) Thanks for the FAQ, it does help me !

-- Florent Bouchy -- Prof. Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it