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