Standard project directories initialized by cvs2svn.

git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@1 ce95ca40-cb61-4e84-aeba-b4b612511386
Initial revision


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@2 ce95ca40-cb61-4e84-aeba-b4b612511386
experimentell


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@3 ce95ca40-cb61-4e84-aeba-b4b612511386
Cleaned up.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@4 ce95ca40-cb61-4e84-aeba-b4b612511386
documented


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@5 ce95ca40-cb61-4e84-aeba-b4b612511386
Vor der Verwendung von BB[alpha] range trees.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@6 ce95ca40-cb61-4e84-aeba-b4b612511386
Neu-Implementation unter Verwendung von BB[alpha] trees. Es gibt noch
Fehler bei OrthogonalRangeSearch: zu viele Vektoren werden
reportet. Dies "au"sert sich in den `Bad reducer'-Meldungen.

Rechnet richtig und schneller als die alte Implementation mit RB-Trees
und lexikographischer Ordnung.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@7 ce95ca40-cb61-4e84-aeba-b4b612511386
Laufzeiten: n=5 3.5s, n=6 26s, n=7 4m43s, n=8 36m, n=9 308m
Ist h die Gr"o"se des Outputs, so ist die Laufzeit gesch"atzt
O(h^{1.79}). (Die alte Implementation mit RB-Trees brauchte noch etwa
O(h^3).)


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@8 ce95ca40-cb61-4e84-aeba-b4b612511386
Added a simple check whether u+v can be reduced by u; in this case,
the whole reduction machinery can be left out. This reduces the
running time by a factor.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@9 ce95ca40-cb61-4e84-aeba-b4b612511386
Using fixed bbalpha; removed FIXME.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@10 ce95ca40-cb61-4e84-aeba-b4b612511386
Ich speichere jetzt (nach R. Urbaniak) nur noch `modulo
Vorzeichen', dh, erster Nichtnulleintrag ist immer positiv.
Laufzeit vorher: 7 -> user 1m50.480s, 7 SINGLE_RANGE -> user
1m42.930s. Laufzeit jetzt: 7 SINGLE_RANGE -> user 0m55.900s


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@11 ce95ca40-cb61-4e84-aeba-b4b612511386
Initial implementation of R. Urbaniak's PPI algorithms.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@13 ce95ca40-cb61-4e84-aeba-b4b612511386
Unified the search modes; they perform about equally.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@14 ce95ca40-cb61-4e84-aeba-b4b612511386
Minor changes.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@15 ce95ca40-cb61-4e84-aeba-b4b612511386
Now the last nonzero component is always positive. Took some more care
in the positive/negative reduction code. Hopefully this will fix n=14.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@16 ce95ca40-cb61-4e84-aeba-b4b612511386
Remove obsolete check. Gives back memory.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@17 ce95ca40-cb61-4e84-aeba-b4b612511386
Added reducibility checks.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@18 ce95ca40-cb61-4e84-aeba-b4b612511386
n=14 still need POST_CHECK, but everything else quite ok now.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@19 ce95ca40-cb61-4e84-aeba-b4b612511386
Added some special-purpose reduction code, for use in iterative
computation (4.3.11) and post-check for reducibility.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@20 ce95ca40-cb61-4e84-aeba-b4b612511386
Some optimization.


git-svn-id: https://svn-mkoeppe.math.ucdavis.edu/usvn/svn/4ti2/trunk@21 ce95ca40-cb61-4e84-aeba-b4b612511386