2 date: Sat 02 Jul 2022 04:23:41 PM CEST
4 - support recent versions of clang
7 date: Sat 01 May 2021 12:50:27 PM CEST
9 - support recent versions of clang
10 - fix minor bug involving implicit equality constraints
13 date: Sun 01 Nov 2020 03:46:32 PM CET
15 - support recent versions of clang
18 date: Wed Nov 13 11:37:55 CET 2019
20 - support more recent versions of NTL
23 date: Thu Mar 28 18:33:44 CET 2019
28 date: Mon Jul 30 22:57:00 CEST 2018
30 - add LICENSE file to distribution
34 date: Tue Mar 6 21:23:21 CET 2018
36 - drop support for applying "codegen" to a set from iscc
39 date: Thu Feb 23 10:03:21 CET 2017
44 date: Fri Jan 15 09:20:30 CET 2016
46 - support more recent versions of NTL
47 - support more operations in iscc
50 date: Tue Jun 16 12:36:25 CEST 2015
52 - support more recent versions of GLPK
53 - support schedule trees in iscc
57 date: Mon Apr 14 11:22:44 CEST 2014
60 - integrate isl-polylib submodule
64 date: Mon Dec 3 09:34:27 CET 2012
66 - support fixed power operation in iscc
67 - use isl for codegen operation in iscc
68 - drop cloog submodule
71 date: Sun Dec 18 10:49:36 CET 2011
74 - drop omega submodule
75 - preliminary Python bindings
78 date: Thu Jul 14 12:31:21 CEST 2011
81 - change license to GPLv2+ (from GPLv2)
84 date: Fri Mar 18 17:35:10 CET 2011
86 - add isl_set_apply_pw_qpolynomial
87 - drop piplib submodule
88 - barvinok_bound and barvinok_summate now accept input in isl notation
89 - use isl for more operations
93 date: Mon Sep 13 11:38:47 CEST 2010
95 - fix parameter alignment in iscc
98 date: Fri Sep 10 14:58:48 CEST 2010
100 - support named and nested spaces
101 - support union sets and maps
102 - add isl_map_apply_pw_qpolynomial
103 - use union sets and maps in iscc
104 - support codegen operation in iscc if CLooG is available
107 date: Tue Jun 29 13:18:52 CEST 2010
109 - use isl for argument parsing
110 - minor compilation fixes
111 - drop bernstein library in favor of isl implementation
112 - drop Omega calculator
113 - the Omega submodule is no longer compiled by default
114 - improved isl based calculator
115 - drop barvinok_enumerate_pip_with_options
118 date: Wed Mar 10 18:10:33 CET 2010
120 - add isl interface and new isl based calculator
121 - barvinok_enumerate now returns NaN on infinite problems
122 - minor compilation and bug fixes
123 - support newer versions of TOPCOM
126 date: Wed Jul 22 15:14:01 CEST 2009
128 - new version of Laurent expansion based exact summation
129 - minor compilation and bug fixes
130 - add semigroup_holes application
131 - add vector_partition_chambers application
134 date: Thu Oct 16 21:56:01 CEST 2008
136 - add omega as submodule
137 - minor compilation and bug fixes
140 date: Sun May 4 23:42:49 CEST 2008
142 - add Parker's library for DFA based counting
143 - support nested sums based exact summation
144 - support Laurent expansion based exact summation
145 - handle equalities and factors in summation
146 - support range propagation for computing bounds
147 - support computation of exact bound through iteration
148 - fix conversion from GiNaC's numeric to Values
151 date: Wed Jan 16 23:45:17 CET 2008
153 - support computation of generating functions in barvinok_enumerate_e
154 - support polymake 2.3
155 - support GiNaC 1.3.8 and newer
156 - support summation using Bernoulli formula
157 - add and use zsolve from 4ti2 for computing Hilbert bases of cones
158 - support use of piplib for solving LPs
159 - add polyhedron_integer_hull and polytope_minimize
160 - add polytope_lattice_width for computing the lattice widths of polytopes
163 date: Tue Sep 11 22:02:22 CEST 2007
165 - add PolyLib and piplib as submodules
166 - remove compatibility with old versions of PolyLib and piplib
167 - support use of piplib for basis reduction
168 - support summation using local Euler-Maclaurin formula for 2D polytopes
169 - support TOPCOM based chamber decompositions
170 - simplify primal decomposition
173 date: Sat Jun 30 23:37:31 CEST 2007
175 - support exponential (Todd) substitution for non-parametric problems
176 - support primal and stopped decomposition on parametric problems
177 - support nested sums polynomial approximation of quasi-polynomials
178 - add barvinok_summate for summating a polynomial over a polytope
179 - speed improvements in barvinok_count and polyhedron_sample
182 date: Sat Apr 28 20:10:35 CEST 2007
184 - use arpg for argument parsing in most commands
186 support polynomial approximations of quasi-polynomials, including
187 volume computation, Meister's method and replacing fractional parts
189 - add barvinok_maximize for computing upper (and lower) bounds
190 - support non-parametric primal and stopped Barvinok decomposition
191 - periodic number representation now run-time configurable
192 - drop support for ancient PolyLib versions
193 - simplified partitioning of chamber complex
194 - add evalue_eval, an exact version of copmute_evalue
195 - improved handling of large generating functions
196 - integrate barvinok_series functionality into barvinok_enumerate
197 - support use of cdd for solving LPs in basis reduction
198 - initial support for computing bounds over quasi-polynomials
199 - recursive Bernstein expansion
200 - corrections and improvements of lexmin
201 - optionally print quasi-polynomial as list of polynomials
202 - add some documentation
205 date: Tue Oct 31 23:15:15 CET 2006
207 - include bernstein library with interface to barvinok and occ
209 - barvinok_count now only returns -1 for unbounded polyhedra with integer points
210 - preliminary implementation of projection via neighborhood complexes
211 - implement generalized basis reduction
212 - add polyhedron_sample
215 - some internal reorganization
216 - some gen_fun clean-ups and optimizations
217 - plug some memory leaks
218 - fix some corner cases
219 - shared libraries are no longer built by default
220 - introduce barvinok_options to pass to functions instead of just MaxRays
221 - use same LLL reduction parameter that LattE uses
222 - add some documentation
225 date: Thu Jun 22 20:49:11 CEST 2006
227 - add some documentation
228 - add barvinok_ehrhart
229 - add h_star_vector polymake client
230 - fix some corner cases
231 - more experimental support for enumerating unions of polytopes
232 - rename cdd2polylib.pl to latte2polylib.pl
235 date: Wed Feb 22 12:01:23 CET 2006
237 - fix PIP-based reduction by removing some code and assuming a recent PIP
238 - some memory leaks plugged
239 - optionally use Omega as a preprocessor in barvinok_enumerate_e
240 - integrate verif_ehrhart_e into barvinok_enumerate_e
241 - barvinok_series handles more problem with equalities
242 - add gen_fun::Hadamard_product
243 - experimental support for enumerating unions of polytopes
246 date: Fri Jan 20 22:14:44 CET 2006
248 - include Omega Calculator interface occ
249 - print_enode creates parameter names if none are provided
250 - only use PIP to project out some variables
251 - some header file fixes
255 date: Thu Sep 15 11:27:19 CEST 2005
257 - factor polyhedra into independent parts before enumeration
258 - make "random vector" specialization more robust
259 - speed up verif_ehrhart by only checking inside the context
260 - remove {Param,}Polyhedron_Reduce
261 - rename triangularize_cone to triangulate_cone
262 - generalize computation of lexmin/max using PIP
263 - compute the number of lexsmaller elements using PolyLib's LexSmaller
266 date: Mon Aug 1 12:23:50 CEST 2005
268 - fix some configuration problems
269 - include minimal polymake client
272 date: Thu Jun 30 12:10:29 CEST 2005
274 - implement "breadth-first" incremental specialization
275 - implement non-incremental version for series computation
276 - make non-incremental specialization the default again
277 - check for bad PolyLib version at runtime
278 - compiles on Windows (mingw32)
280 - allow crosscompilation
281 - compute the coefficients of an Ehrhart series
282 - fix conversion of PIP output to polyhedra
283 - allow direct verification of Ehrhart series
286 date: Sun Dec 12 23:00:40 CET 2004
288 - export Polyhedron_Project
289 - allow verification of step-functions computed from Ehrhart series
290 - optionally compute step-functions incrementally
291 - disable possibly incorrect optimization
292 - minor optimizations in Ehrhart series computations
295 date: Wed Nov 17 19:22:23 CET 2004
297 - use code for computing series to count non-parametric polytopes
298 - add conversion from series to explicit function
299 - fix removal of redundant equalities
302 date: Sat Oct 16 12:13:30 CEST 2004
304 - use slightly larger random numbers
305 - change basis to remove existential variable
306 - fix bug in reduction
307 - handle empty PIP solution
308 - add utility to remove equalities
311 date: Sun Oct 3 20:47:11 CEST 2004
313 - reduce memory requirements
315 - add patch for NTL 5.3.2
316 - experimental support for Ehrhart series
317 - compile fix on systems that lack <getopt.h>
320 date: Sat Sep 18 14:49:40 CEST 2004
323 - find and use PIP if available
324 - don't overallocate matrices on newer PolyLibs
325 - verification program for enumeration of integer projections
326 - summation of enumerations
328 - support older versions of GMP
331 date: Tue Jul 6 22:09:11 CEST 2004
333 - install header files
334 - modulo representation changed to fractionals
335 - perform some simplifications on the modulo representation
336 - barvinok_enumerate returns a malloc'ed evalue
337 - a few bugs in barvinok_enumerate_e removed
338 - optionally print an indication of the size of an enumeration
340 - bug in triangularization fixed
341 - bug in polyhedron reduction fixed
342 - verif_ehrhart.c should compile on C89 systems again
346 - bug in polyhedron reduction fixed
349 date: Sun Feb 22 21:15:00 CET 2004
351 - remove remaining part of Kristof's Ehrhart manipulation code
352 - optimize modulo expression based on validity domain
353 - support partition evalues
354 - factor out 1D polytopes
355 - validity domains can now be unions of polytopes
356 - optionally convert modulo representation to lookup-table
357 - rename indicator to relation
362 - support "indicator" evalues
363 - support equalities for modulo representation
367 - remove part of Kristof's Ehrhart manipulation code
368 - partial support for modulo representation
369 - support cvs version of PolyLib
372 date: Thu Nov 27 13:35:59 CET 2003
375 include code from Kristof Beyls for manipulating Ehrhart
378 implement barvinok_enumerate for constructing Ehrhart
379 polynomials using barvinok's algorithm
382 date: Thu Nov 6 01:36:25 CET 2003
385 allow specification of max #constraints
386 for those without automatically growing chernikova tables
387 - fix a few small bugs
388 - some minor optimizations
391 date: Mon Nov 3 16:35:57 CET 2003
393 - fix a number of bugs
397 date: Mon Oct 20 14:15:45 CEST 2003
399 - change name from count to barvinok_count
400 - return -1 if polyhedron is unbounded
401 - trivially optimize counting in presence of some independent constraints