| blob | 5db6c7627266dfb436c88bc52a20f598412db67d |
1 version: 0.24
2 date: Sat Jun 30 23:37:31 CEST 2007
3 changes:
4 - support exponential (Todd) substitution for non-parametric problems
5 - support primal and stopped decomposition on parametric problems
6 - support nested sums polynomial approximation of quasi-polynomials
7 - add barvinok_summate for summating a polynomial over a polytope
8 - speed improvements in barvinok_count and polyhedron_sample
9 ---
10 version: 0.23
11 date: Sat Apr 28 20:10:35 CEST 2007
12 changes:
13 - use arpg for argument parsing in most commands
14 - |-
15 support polynomial approximations of quasi-polynomials, including
16 volume computation, Meister's method and replacing fractional parts
17 by constants
18 - add barvinok_maximize for computing upper (and lower) bounds
19 - support non-parametric primal and stopped Barvinok decomposition
20 - periodic number representation now run-time configurable
21 - drop support for ancient PolyLib versions
22 - simplified partitioning of chamber complex
23 - add evalue_eval, an exact version of copmute_evalue
24 - improved handling of large generating functions
25 - integrate barvinok_series functionality into barvinok_enumerate
26 - support use of cdd for solving LPs in basis reduction
27 - initial support for computing bounds over quasi-polynomials
28 - recursive Bernstein expansion
29 - corrections and improvements of lexmin
30 - optionally print quasi-polynomial as list of polynomials
31 - add some documentation
32 ---
33 version: 0.22
34 date: Tue Oct 31 23:15:15 CET 2006
35 changes:
36 - include bernstein library with interface to barvinok and occ
37 - some occ clean-ups
38 - barvinok_count now only returns -1 for unbounded polyhedra with integer points
39 - preliminary implementation of projection via neighborhood complexes
40 - implement generalized basis reduction
41 - add polyhedron_sample
42 - add polytope_scan
43 - add lexmin
44 - some internal reorganization
45 - some gen_fun clean-ups and optimizations
46 - plug some memory leaks
47 - fix some corner cases
48 - shared libraries are no longer built by default
49 - introduce barvinok_options to pass to functions instead of just MaxRays
50 - use same LLL reduction parameter that LattE uses
51 - add some documentation
52 ---
53 version: 0.21
54 date: Thu Jun 22 20:49:11 CEST 2006
55 changes:
56 - add some documentation
57 - add barvinok_ehrhart
58 - add h_star_vector polymake client
59 - fix some corner cases
60 - more experimental support for enumerating unions of polytopes
61 - rename cdd2polylib.pl to latte2polylib.pl
62 ---
63 version: 0.20
64 date: Wed Feb 22 12:01:23 CET 2006
65 changes:
66 - fix PIP-based reduction by removing some code and assuming a recent PIP
67 - some memory leaks plugged
68 - optionally use Omega as a preprocessor in barvinok_enumerate_e
69 - integrate verif_ehrhart_e into barvinok_enumerate_e
70 - barvinok_series handles more problem with equalities
71 - add gen_fun::Hadamard_product
72 - experimental support for enumerating unions of polytopes
73 ---
74 version: 0.19
75 date: Fri Jan 20 22:14:44 CET 2006
76 changes:
77 - include Omega Calculator interface occ
78 - print_enode creates parameter names if none are provided
79 - only use PIP to project out some variables
80 - some header file fixes
81 - C89 fixes again
82 ---
83 version: 0.18
84 date: Thu Sep 15 11:27:19 CEST 2005
85 changes:
86 - factor polyhedra into independent parts before enumeration
87 - make "random vector" specialization more robust
88 - speed up verif_ehrhart by only checking inside the context
89 - remove {Param,}Polyhedron_Reduce
90 - rename triangularize_cone to triangulate_cone
91 - generalize computation of lexmin/max using PIP
92 - compute the number of lexsmaller elements using PolyLib's LexSmaller
93 ---
94 version: 0.17
95 date: Mon Aug 1 12:23:50 CEST 2005
96 changes:
97 - fix some configuration problems
98 - include minimal polymake client
99 ---
100 version: 0.16
101 date: Thu Jun 30 12:10:29 CEST 2005
102 changes:
103 - implement "breadth-first" incremental specialization
104 - implement non-incremental version for series computation
105 - make non-incremental specialization the default again
106 - check for bad PolyLib version at runtime
107 - compiles on Windows (mingw32)
108 - add version option
109 - allow crosscompilation
110 - compute the coefficients of an Ehrhart series
111 - fix conversion of PIP output to polyhedra
112 - allow direct verification of Ehrhart series
113 ---
114 version: 0.15
115 date: Sun Dec 12 23:00:40 CET 2004
116 changes:
117 - export Polyhedron_Project
118 - allow verification of step-functions computed from Ehrhart series
119 - optionally compute step-functions incrementally
120 - disable possibly incorrect optimization
121 - minor optimizations in Ehrhart series computations
122 ---
123 version: 0.14
124 date: Wed Nov 17 19:22:23 CET 2004
125 changes:
126 - use code for computing series to count non-parametric polytopes
127 - add conversion from series to explicit function
128 - fix removal of redundant equalities
129 ---
130 version: 0.13
131 date: Sat Oct 16 12:13:30 CEST 2004
132 changes:
133 - use slightly larger random numbers
134 - change basis to remove existential variable
135 - fix bug in reduction
136 - handle empty PIP solution
137 - add utility to remove equalities
138 ---
139 version: 0.12
140 date: Sun Oct 3 20:47:11 CEST 2004
141 changes:
142 - reduce memory requirements
143 - add cdd2polylib.pl
144 - add patch for NTL 5.3.2
145 - experimental support for Ehrhart series
146 - compile fix on systems that lack <getopt.h>
147 ---
148 version: 0.11
149 date: Sat Sep 18 14:49:40 CEST 2004
150 changes:
151 - fix minor bugs
152 - find and use PIP if available
153 - don't overallocate matrices on newer PolyLibs
154 - verification program for enumeration of integer projections
155 - summation of enumerations
156 - avoid gccisms
157 - support older versions of GMP
158 ---
159 version: 0.10
160 date: Tue Jul 6 22:09:11 CEST 2004
161 changes:
162 - install header files
163 - modulo representation changed to fractionals
164 - perform some simplifications on the modulo representation
165 - barvinok_enumerate returns a malloc'ed evalue
166 - a few bugs in barvinok_enumerate_e removed
167 - optionally print an indication of the size of an enumeration
168 - emask added
169 - bug in triangularization fixed
170 - bug in polyhedron reduction fixed
171 - verif_ehrhart.c should compile on C89 systems again
172 ---
173 version: 0.09
174 changes:
175 - bug in polyhedron reduction fixed
176 ---
177 version: 0.08
178 date: Sun Feb 22 21:15:00 CET 2004
179 changes:
180 - remove remaining part of Kristof's Ehrhart manipulation code
181 - optimize modulo expression based on validity domain
182 - support partition evalues
183 - factor out 1D polytopes
184 - validity domains can now be unions of polytopes
185 - optionally convert modulo representation to lookup-table
186 - rename indicator to relation
187 - add DomainIncludes
188 ---
189 version: 0.07
190 changes:
191 - support "indicator" evalues
192 - support equalities for modulo representation
193 ---
194 version: 0.06
195 changes:
196 - remove part of Kristof's Ehrhart manipulation code
197 - partial support for modulo representation
198 - support cvs version of PolyLib
199 ---
200 version: 0.05
201 date: Thu Nov 27 13:35:59 CET 2003
202 changes:
203 - |-
204 include code from Kristof Beyls for manipulating Ehrhart
205 polynomials
206 - |-
207 implement barvinok_enumerate for constructing Ehrhart
208 polynomials using barvinok's algorithm
209 ---
210 version: 0.04
211 date: Thu Nov 6 01:36:25 CET 2003
212 changes:
213 - |-
214 allow specification of max #constraints
215 for those without automatically growing chernikova tables
216 - fix a few small bugs
217 - some minor optimizations
218 ---
219 version: 0.03
220 date: Mon Nov 3 16:35:57 CET 2003
221 changes:
222 - fix a number of bugs
223 - add tests
224 ---
225 version: 0.02
226 date: Mon Oct 20 14:15:45 CEST 2003
227 changes:
228 - change name from count to barvinok_count
229 - return -1 if polyhedron is unbounded
230 - trivially optimize counting in presence of some independent constraints