3 date: Mon Aug 1 12:23:50 CEST 2005
5 - fix some configuration problems
6 - include minimal polymake client
9 date: Thu Jun 30 12:10:29 CEST 2005
11 - implement "breadth-first" incremental specialization
12 - implement non-incremental version for series computation
13 - make non-incremental specialization the default again
14 - check for bad PolyLib version at runtime
15 - compiles on Windows (mingw32)
17 - allow crosscompilation
18 - compute the coefficients of an Ehrhart series
19 - fix conversion of PIP output to polyhedra
20 - allow direct verification of Ehrhart series
23 date: Sun Dec 12 23:00:40 CET 2004
25 - export Polyhedron_Project
26 - allow verification of step-functions computed from Ehrhart series
27 - optionally compute step-functions incrementally
28 - disable possibly incorrect optimization
29 - minor optimizations in Ehrhart series computations
32 date: Wed Nov 17 19:22:23 CET 2004
34 - use code for computing series to count non-parametric polytopes
35 - add conversion from series to explicit function
36 - fix removal of redundant equalities
39 date: Sat Oct 16 12:13:30 CEST 2004
41 - use slightly larger random numbers
42 - change basis to remove existential variable
43 - fix bug in reduction
44 - handle empty PIP solution
45 - add utility to remove equalities
48 date: Sun Oct 3 20:47:11 CEST 2004
50 - reduce memory requirements
52 - add patch for NTL 5.3.2
53 - experimental support for Ehrhart series
54 - compile fix on systems that lack <getopt.h>
57 date: Sat Sep 18 14:49:40 CEST 2004
60 - find and use PIP if available
61 - don't overallocate matrices on newer PolyLibs
62 - verification program for enumeration of integer projections
63 - summation of enumerations
65 - support older versions of GMP
68 date: Tue Jul 6 22:09:11 CEST 2004
70 - install header files
71 - modulo representation changed to fractionals
72 - perform some simplifications on the modulo representation
73 - barvinok_enumerate returns a malloc'ed evalue
74 - a few bugs in barvinok_enumerate_e removed
75 - optionally print an indication of the size of an enumeration
77 - bug in triangularization fixed
78 - bug in polyhedron reduction fixed
79 - verif_ehrhart.c should compile on C89 systems again
83 - bug in polyhedron reduction fixed
86 date: Sun Feb 22 21:15:00 CET 2004
88 - remove remaining part of Kristof's Ehrhart manipulation code
89 - optimize modulo expression based on validity domain
90 - support partition evalues
91 - factor out 1D polytopes
92 - validity domains can now be unions of polytopes
93 - optionally convert modulo representation to lookup-table
94 - rename indicator to relation
99 - support "indicator" evalues
100 - support equalities for modulo representation
104 - remove part of Kristof's Ehrhart manipulation code
105 - partial support for modulo respresentation
106 - support cvs version of PolyLib
109 date: Thu Nov 27 13:35:59 CET 2003
112 include code from Kristof Beyls for manipulating Ehrhart
115 implement barvinok_enumerate for constructing Ehrhart
116 polynomials using barvinok's algorithm
119 date: Thu Nov 6 01:36:25 CET 2003
122 allow specification of max #constraints
123 for those without automatically growing chernikova tables
124 - fix a few small bugs
125 - some minor optimizations
128 date: Mon Nov 3 16:35:57 CET 2003
130 - fix a number of bugs
134 date: Mon Oct 20 14:15:45 CEST 2003
136 - change name from count to barvinok_count
137 - return -1 if polyhedron is unbounded
138 - trivially optimize counting in presence of some independent constraints