AngouriMath

Navigation

GroebnerBudget


← Back to list of classes

Description

Summary

What a Gröbner computation is allowed to spend before it gives up.

Remarks

Buchberger is doubly exponential in the worst case, so declining has to be reachable:
a caller waiting forever is a worse answer than "not this one". Several separate
ceilings because the ways it runs away are not the same — a system can blow up in the
number of pairs, in the size of one polynomial, in the width of the rationals while
everything else stays small, or in none of those while simply taking too long.
Coefficient width is here because it is the one that actually fires: a system has
been seen to give up with 53 pairs and 64 terms and coefficients 188 digits wide,
which no count of pairs or terms would have caught.
The ceilings below are this algorithm's; the accounting is
BudgetLedger, which every bounded computation shares. That is what
lets the reason survive: a ledger names which ceiling fired and hands that to
BudgetRecording, where the old private budget recorded the same string
and nothing ever read it
(#896).

Members

























Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online