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