| blob | 0f91dc3e238f3ae5abf0344417a96e635d8a8055 |
1 version: 0.33
2 date: Fri Mar 18 17:35:10 CET 2011
3 changes:
4 - add isl_set_apply_pw_qpolynomial
5 - drop piplib submodule
6 - barvinok_bound and barvinok_summate now accept input in isl notation
7 - use isl for more operations
8 - improved iscc
9 ---
10 version: 0.32.1
11 date: Mon Sep 13 11:38:47 CEST 2010
12 changes:
13 - fix parameter alignment in iscc
14 ---
15 version: 0.32
16 date: Fri Sep 10 14:58:48 CEST 2010
17 changes:
18 - support named and nested spaces
19 - support union sets and maps
20 - add isl_map_apply_pw_qpolynomial
21 - use union sets and maps in iscc
22 - support codegen operation in iscc if CLooG is available
23 ---
24 version: 0.31
25 date: Tue Jun 29 13:18:52 CEST 2010
26 changes:
27 - use isl for argument parsing
28 - minor compilation fixes
29 - drop bernstein library in favor of isl implementation
30 - drop Omega calculator
31 - the Omega submodule is no longer compiled by default
32 - improved isl based calculator
33 - drop barvinok_enumerate_pip_with_options
34 ---
35 version: 0.30
36 date: Wed Mar 10 18:10:33 CET 2010
37 changes:
38 - add isl interface and new isl based calculator
39 - barvinok_enumerate now returns NaN on infinite problems
40 - minor compilation and bug fixes
41 - support newer versions of TOPCOM
42 ---
43 version: 0.29
44 date: Wed Jul 22 15:14:01 CEST 2009
45 changes:
46 - new version of Laurent expansion based exact summation
47 - minor compilation and bug fixes
48 - add semigroup_holes application
49 - add vector_partition_chambers application
50 ---
51 version: 0.28
52 date: Thu Oct 16 21:56:01 CEST 2008
53 changes:
54 - add omega as submodule
55 - minor compilation and bug fixes
56 ---
57 version: 0.27
58 date: Sun May 4 23:42:49 CEST 2008
59 changes:
60 - add Parker's library for DFA based counting
61 - support nested sums based exact summation
62 - support Laurent expansion based exact summation
63 - handle equalities and factors in summation
64 - support range propagation for computing bounds
65 - support computation of exact bound through iteration
66 - fix conversion from GiNaC's numeric to Values
67 ---
68 version: 0.26
69 date: Wed Jan 16 23:45:17 CET 2008
70 changes:
71 - support computation of generating functions in barvinok_enumerate_e
72 - support polymake 2.3
73 - support GiNaC 1.3.8 and newer
74 - support summation using Bernoulli formula
75 - add and use zsolve from 4ti2 for computing Hilbert bases of cones
76 - support use of piplib for solving LPs
77 - add polyhedron_integer_hull and polytope_minimize
78 - add polytope_lattice_width for computing the lattice widths of polytopes
79 ---
80 version: 0.25
81 date: Tue Sep 11 22:02:22 CEST 2007
82 changes:
83 - add PolyLib and piplib as submodules
84 - remove compatibility with old versions of PolyLib and piplib
85 - support use of piplib for basis reduction
86 - support summation using local Euler-Maclaurin formula for 2D polytopes
87 - support TOPCOM based chamber decompositions
88 - simplify primal decomposition
89 ---
90 version: 0.24
91 date: Sat Jun 30 23:37:31 CEST 2007
92 changes:
93 - support exponential (Todd) substitution for non-parametric problems
94 - support primal and stopped decomposition on parametric problems
95 - support nested sums polynomial approximation of quasi-polynomials
96 - add barvinok_summate for summating a polynomial over a polytope
97 - speed improvements in barvinok_count and polyhedron_sample
98 ---
99 version: 0.23
100 date: Sat Apr 28 20:10:35 CEST 2007
101 changes:
102 - use arpg for argument parsing in most commands
103 - |-
104 support polynomial approximations of quasi-polynomials, including
105 volume computation, Meister's method and replacing fractional parts
106 by constants
107 - add barvinok_maximize for computing upper (and lower) bounds
108 - support non-parametric primal and stopped Barvinok decomposition
109 - periodic number representation now run-time configurable
110 - drop support for ancient PolyLib versions
111 - simplified partitioning of chamber complex
112 - add evalue_eval, an exact version of copmute_evalue
113 - improved handling of large generating functions
114 - integrate barvinok_series functionality into barvinok_enumerate
115 - support use of cdd for solving LPs in basis reduction
116 - initial support for computing bounds over quasi-polynomials
117 - recursive Bernstein expansion
118 - corrections and improvements of lexmin
119 - optionally print quasi-polynomial as list of polynomials
120 - add some documentation
121 ---
122 version: 0.22
123 date: Tue Oct 31 23:15:15 CET 2006
124 changes:
125 - include bernstein library with interface to barvinok and occ
126 - some occ clean-ups
127 - barvinok_count now only returns -1 for unbounded polyhedra with integer points
128 - preliminary implementation of projection via neighborhood complexes
129 - implement generalized basis reduction
130 - add polyhedron_sample
131 - add polytope_scan
132 - add lexmin
133 - some internal reorganization
134 - some gen_fun clean-ups and optimizations
135 - plug some memory leaks
136 - fix some corner cases
137 - shared libraries are no longer built by default
138 - introduce barvinok_options to pass to functions instead of just MaxRays
139 - use same LLL reduction parameter that LattE uses
140 - add some documentation
141 ---
142 version: 0.21
143 date: Thu Jun 22 20:49:11 CEST 2006
144 changes:
145 - add some documentation
146 - add barvinok_ehrhart
147 - add h_star_vector polymake client
148 - fix some corner cases
149 - more experimental support for enumerating unions of polytopes
150 - rename cdd2polylib.pl to latte2polylib.pl
151 ---
152 version: 0.20
153 date: Wed Feb 22 12:01:23 CET 2006
154 changes:
155 - fix PIP-based reduction by removing some code and assuming a recent PIP
156 - some memory leaks plugged
157 - optionally use Omega as a preprocessor in barvinok_enumerate_e
158 - integrate verif_ehrhart_e into barvinok_enumerate_e
159 - barvinok_series handles more problem with equalities
160 - add gen_fun::Hadamard_product
161 - experimental support for enumerating unions of polytopes
162 ---
163 version: 0.19
164 date: Fri Jan 20 22:14:44 CET 2006
165 changes:
166 - include Omega Calculator interface occ
167 - print_enode creates parameter names if none are provided
168 - only use PIP to project out some variables
169 - some header file fixes
170 - C89 fixes again
171 ---
172 version: 0.18
173 date: Thu Sep 15 11:27:19 CEST 2005
174 changes:
175 - factor polyhedra into independent parts before enumeration
176 - make "random vector" specialization more robust
177 - speed up verif_ehrhart by only checking inside the context
178 - remove {Param,}Polyhedron_Reduce
179 - rename triangularize_cone to triangulate_cone
180 - generalize computation of lexmin/max using PIP
181 - compute the number of lexsmaller elements using PolyLib's LexSmaller
182 ---
183 version: 0.17
184 date: Mon Aug 1 12:23:50 CEST 2005
185 changes:
186 - fix some configuration problems
187 - include minimal polymake client
188 ---
189 version: 0.16
190 date: Thu Jun 30 12:10:29 CEST 2005
191 changes:
192 - implement "breadth-first" incremental specialization
193 - implement non-incremental version for series computation
194 - make non-incremental specialization the default again
195 - check for bad PolyLib version at runtime
196 - compiles on Windows (mingw32)
197 - add version option
198 - allow crosscompilation
199 - compute the coefficients of an Ehrhart series
200 - fix conversion of PIP output to polyhedra
201 - allow direct verification of Ehrhart series
202 ---
203 version: 0.15
204 date: Sun Dec 12 23:00:40 CET 2004
205 changes:
206 - export Polyhedron_Project
207 - allow verification of step-functions computed from Ehrhart series
208 - optionally compute step-functions incrementally
209 - disable possibly incorrect optimization
210 - minor optimizations in Ehrhart series computations
211 ---
212 version: 0.14
213 date: Wed Nov 17 19:22:23 CET 2004
214 changes:
215 - use code for computing series to count non-parametric polytopes
216 - add conversion from series to explicit function
217 - fix removal of redundant equalities
218 ---
219 version: 0.13
220 date: Sat Oct 16 12:13:30 CEST 2004
221 changes:
222 - use slightly larger random numbers
223 - change basis to remove existential variable
224 - fix bug in reduction
225 - handle empty PIP solution
226 - add utility to remove equalities
227 ---
228 version: 0.12
229 date: Sun Oct 3 20:47:11 CEST 2004
230 changes:
231 - reduce memory requirements
232 - add cdd2polylib.pl
233 - add patch for NTL 5.3.2
234 - experimental support for Ehrhart series
235 - compile fix on systems that lack <getopt.h>
236 ---
237 version: 0.11
238 date: Sat Sep 18 14:49:40 CEST 2004
239 changes:
240 - fix minor bugs
241 - find and use PIP if available
242 - don't overallocate matrices on newer PolyLibs
243 - verification program for enumeration of integer projections
244 - summation of enumerations
245 - avoid gccisms
246 - support older versions of GMP
247 ---
248 version: 0.10
249 date: Tue Jul 6 22:09:11 CEST 2004
250 changes:
251 - install header files
252 - modulo representation changed to fractionals
253 - perform some simplifications on the modulo representation
254 - barvinok_enumerate returns a malloc'ed evalue
255 - a few bugs in barvinok_enumerate_e removed
256 - optionally print an indication of the size of an enumeration
257 - emask added
258 - bug in triangularization fixed
259 - bug in polyhedron reduction fixed
260 - verif_ehrhart.c should compile on C89 systems again
261 ---
262 version: 0.09
263 changes:
264 - bug in polyhedron reduction fixed
265 ---
266 version: 0.08
267 date: Sun Feb 22 21:15:00 CET 2004
268 changes:
269 - remove remaining part of Kristof's Ehrhart manipulation code
270 - optimize modulo expression based on validity domain
271 - support partition evalues
272 - factor out 1D polytopes
273 - validity domains can now be unions of polytopes
274 - optionally convert modulo representation to lookup-table
275 - rename indicator to relation
276 - add DomainIncludes
277 ---
278 version: 0.07
279 changes:
280 - support "indicator" evalues
281 - support equalities for modulo representation
282 ---
283 version: 0.06
284 changes:
285 - remove part of Kristof's Ehrhart manipulation code
286 - partial support for modulo representation
287 - support cvs version of PolyLib
288 ---
289 version: 0.05
290 date: Thu Nov 27 13:35:59 CET 2003
291 changes:
292 - |-
293 include code from Kristof Beyls for manipulating Ehrhart
294 polynomials
295 - |-
296 implement barvinok_enumerate for constructing Ehrhart
297 polynomials using barvinok's algorithm
298 ---
299 version: 0.04
300 date: Thu Nov 6 01:36:25 CET 2003
301 changes:
302 - |-
303 allow specification of max #constraints
304 for those without automatically growing chernikova tables
305 - fix a few small bugs
306 - some minor optimizations
307 ---
308 version: 0.03
309 date: Mon Nov 3 16:35:57 CET 2003
310 changes:
311 - fix a number of bugs
312 - add tests
313 ---
314 version: 0.02
315 date: Mon Oct 20 14:15:45 CEST 2003
316 changes:
317 - change name from count to barvinok_count
318 - return -1 if polyhedron is unbounded
319 - trivially optimize counting in presence of some independent constraints