3 date: Sun Feb 22 21:15:00 CET 2004
5 - remove remaining part of Kristof's Ehrhart manipulation code
6 - optimize modulo expression based on validity domain
7 - support partition evalues
8 - factor out 1D polytopes
9 - validity domains can now be unions of polytopes
10 - optionally convert modulo representation to lookup-table
11 - rename indicator to relation
16 - support "indicator" evalues
17 - support equalities for modulo representation
21 - remove part of Kristof's Ehrhart manipulation code
22 - partial support for modulo respresentation
23 - support cvs version of PolyLib
26 date: Thu Nov 27 13:35:59 CET 2003
29 include code from Kristof Beyls for manipulating Ehrhart
32 implement barvinok_enumerate for constructing Ehrhart
33 polynomials using barvinok's algorithm
36 date: Thu Nov 6 01:36:25 CET 2003
39 allow specification of max #constraints
40 for those without automatically growing chernikova tables
41 - fix a few small bugs
42 - some minor optimizations
45 date: Mon Nov 3 16:35:57 CET 2003
47 - fix a number of bugs
51 date: Mon Oct 20 14:15:45 CEST 2003
53 - change name from count to barvinok_count
54 - return -1 if polyhedron is unbounded
55 - trivially optimize counting in presence of some independent constraints