2 date: Wed Nov 17 19:22:23 CET 2004
4 - use code for computing series to count non-parametric polytopes
5 - add conversion from series to explicit function
6 - fix removal of redundant equalities
9 date: Sat Oct 16 12:13:30 CEST 2004
11 - use slightly larger random numbers
12 - change basis to remove existential variable
13 - fix bug in reduction
14 - handle empty PIP solution
15 - add utility to remove equalities
18 date: Sun Oct 3 20:47:11 CEST 2004
20 - reduce memory requirements
22 - add patch for NTL 5.3.2
23 - experimental support for Ehrhart series
24 - compile fix on systems that lack <getopt.h>
27 date: Sat Sep 18 14:49:40 CEST 2004
30 - find and use PIP if available
31 - don't overallocate matrices on newer PolyLibs
32 - verification program for enumeration of integer projections
33 - summation of enumerations
35 - support older versions of GMP
38 date: Tue Jul 6 22:09:11 CEST 2004
40 - install header files
41 - modulo representation changed to fractionals
42 - perform some simplifications on the modulo representation
43 - barvinok_enumerate returns a malloc'ed evalue
44 - a few bugs in barvinok_enumerate_e removed
45 - optionally print an indication of the size of an enumeration
47 - bug in triangularization fixed
48 - bug in polyhedron reduction fixed
49 - verif_ehrhart.c should compile on C89 systems again
53 - bug in polyhedron reduction fixed
56 date: Sun Feb 22 21:15:00 CET 2004
58 - remove remaining part of Kristof's Ehrhart manipulation code
59 - optimize modulo expression based on validity domain
60 - support partition evalues
61 - factor out 1D polytopes
62 - validity domains can now be unions of polytopes
63 - optionally convert modulo representation to lookup-table
64 - rename indicator to relation
69 - support "indicator" evalues
70 - support equalities for modulo representation
74 - remove part of Kristof's Ehrhart manipulation code
75 - partial support for modulo respresentation
76 - support cvs version of PolyLib
79 date: Thu Nov 27 13:35:59 CET 2003
82 include code from Kristof Beyls for manipulating Ehrhart
85 implement barvinok_enumerate for constructing Ehrhart
86 polynomials using barvinok's algorithm
89 date: Thu Nov 6 01:36:25 CET 2003
92 allow specification of max #constraints
93 for those without automatically growing chernikova tables
94 - fix a few small bugs
95 - some minor optimizations
98 date: Mon Nov 3 16:35:57 CET 2003
100 - fix a number of bugs
104 date: Mon Oct 20 14:15:45 CEST 2003
106 - change name from count to barvinok_count
107 - return -1 if polyhedron is unbounded
108 - trivially optimize counting in presence of some independent constraints