| blob | 274c288da06c473add27f4d02ae0d3b03a447887 |
1 version: 0.20
2 date: Wed Feb 22 12:01:23 CET 2006
3 changes:
4 - fix PIP-based reduction by removing some code and assuming a recent PIP
5 - some memory leaks plugged
6 - optionally use Omega as a preprocessor in barvinok_enumerate_e
7 - integrate verif_ehrhart_e into barvinok_enumerate_e
8 - barvinok_series handles more problem with equalities
9 - add gen_fun::Hadamard_product
10 - experimental support for enumerating unions of polytopes
11 ---
12 version: 0.19
13 date: Fri Jan 20 22:14:44 CET 2006
14 changes:
15 - include Omega Calculator interface occ
16 - print_enode creates parameter names if none are provided
17 - only use PIP to project out some variables
18 - some header file fixes
19 - C89 fixes again
20 ---
21 version: 0.18
22 date: Thu Sep 15 11:27:19 CEST 2005
23 changes:
24 - factor polyhedra into independent parts before enumeration
25 - make "random vector" specialization more robust
26 - speed up verif_ehrhart by only checking inside the context
27 - remove {Param,}Polyhedron_Reduce
28 - rename triangularize_cone to triangulate_cone
29 - generalize computation of lexmin/max using PIP
30 - compute the number of lexsmaller elements using PolyLib's LexSmaller
31 ---
32 version: 0.17
33 date: Mon Aug 1 12:23:50 CEST 2005
34 changes:
35 - fix some configuration problems
36 - include minimal polymake client
37 ---
38 version: 0.16
39 date: Thu Jun 30 12:10:29 CEST 2005
40 changes:
41 - implement "breadth-first" incremental specialization
42 - implement non-incremental version for series computation
43 - make non-incremental specialization the default again
44 - check for bad PolyLib version at runtime
45 - compiles on Windows (mingw32)
46 - add version option
47 - allow crosscompilation
48 - compute the coefficients of an Ehrhart series
49 - fix conversion of PIP output to polyhedra
50 - allow direct verification of Ehrhart series
51 ---
52 version: 0.15
53 date: Sun Dec 12 23:00:40 CET 2004
54 changes:
55 - export Polyhedron_Project
56 - allow verification of step-functions computed from Ehrhart series
57 - optionally compute step-functions incrementally
58 - disable possibly incorrect optimization
59 - minor optimizations in Ehrhart series computations
60 ---
61 version: 0.14
62 date: Wed Nov 17 19:22:23 CET 2004
63 changes:
64 - use code for computing series to count non-parametric polytopes
65 - add conversion from series to explicit function
66 - fix removal of redundant equalities
67 ---
68 version: 0.13
69 date: Sat Oct 16 12:13:30 CEST 2004
70 changes:
71 - use slightly larger random numbers
72 - change basis to remove existential variable
73 - fix bug in reduction
74 - handle empty PIP solution
75 - add utility to remove equalities
76 ---
77 version: 0.12
78 date: Sun Oct 3 20:47:11 CEST 2004
79 changes:
80 - reduce memory requirements
81 - add cdd2polylib.pl
82 - add patch for NTL 5.3.2
83 - experimental support for Ehrhart series
84 - compile fix on systems that lack <getopt.h>
85 ---
86 version: 0.11
87 date: Sat Sep 18 14:49:40 CEST 2004
88 changes:
89 - fix minor bugs
90 - find and use PIP if available
91 - don't overallocate matrices on newer PolyLibs
92 - verification program for enumeration of integer projections
93 - summation of enumerations
94 - avoid gccisms
95 - support older versions of GMP
96 ---
97 version: 0.10
98 date: Tue Jul 6 22:09:11 CEST 2004
99 changes:
100 - install header files
101 - modulo representation changed to fractionals
102 - perform some simplifications on the modulo representation
103 - barvinok_enumerate returns a malloc'ed evalue
104 - a few bugs in barvinok_enumerate_e removed
105 - optionally print an indication of the size of an enumeration
106 - emask added
107 - bug in triangularization fixed
108 - bug in polyhedron reduction fixed
109 - verif_ehrhart.c should compile on C89 systems again
110 ---
111 version: 0.09
112 changes:
113 - bug in polyhedron reduction fixed
114 ---
115 version: 0.08
116 date: Sun Feb 22 21:15:00 CET 2004
117 changes:
118 - remove remaining part of Kristof's Ehrhart manipulation code
119 - optimize modulo expression based on validity domain
120 - support partition evalues
121 - factor out 1D polytopes
122 - validity domains can now be unions of polytopes
123 - optionally convert modulo representation to lookup-table
124 - rename indicator to relation
125 - add DomainIncludes
126 ---
127 version: 0.07
128 changes:
129 - support "indicator" evalues
130 - support equalities for modulo representation
131 ---
132 version: 0.06
133 changes:
134 - remove part of Kristof's Ehrhart manipulation code
135 - partial support for modulo respresentation
136 - support cvs version of PolyLib
137 ---
138 version: 0.05
139 date: Thu Nov 27 13:35:59 CET 2003
140 changes:
141 - |-
142 include code from Kristof Beyls for manipulating Ehrhart
143 polynomials
144 - |-
145 implement barvinok_enumerate for constructing Ehrhart
146 polynomials using barvinok's algorithm
147 ---
148 version: 0.04
149 date: Thu Nov 6 01:36:25 CET 2003
150 changes:
151 - |-
152 allow specification of max #constraints
153 for those without automatically growing chernikova tables
154 - fix a few small bugs
155 - some minor optimizations
156 ---
157 version: 0.03
158 date: Mon Nov 3 16:35:57 CET 2003
159 changes:
160 - fix a number of bugs
161 - add tests
162 ---
163 version: 0.02
164 date: Mon Oct 20 14:15:45 CEST 2003
165 changes:
166 - change name from count to barvinok_count
167 - return -1 if polyhedron is unbounded
168 - trivially optimize counting in presence of some independent constraints