3 date: Thu Nov 27 13:35:59 CET 2003
6 include code from Kristof Beyls for manipulating Ehrhart
9 implement barvinok_enumerate for constructing Ehrhart
10 polynomials using barvinok's algorithm
13 date: Thu Nov 6 01:36:25 CET 2003
16 allow specification of max #constraints
17 for those without automatically growing chernikova tables
18 - fix a few small bugs
19 - some minor optimizations
22 date: Mon Nov 3 16:35:57 CET 2003
24 - fix a number of bugs
28 date: Mon Oct 20 14:15:45 CEST 2003
30 - change name from count to barvinok_count
31 - return -1 if polyhedron is unbounded
32 - trivially optimize counting in presence of some independent constraints