Feature #1167
New class VerificationLevel
Description
To help offer the user the chance to choose between guaranteed algorithms and fast, probably-correct ones,
create a new class VerificationLevel which can be given to indicate whether to use a guaranteed
algorithm, or the level of verification to apply after using a probably-correct one.
Possible applications are for the algorithms which use MinPoly internally (e.g. radical for 0-dim ideals),
perhaps also for primality testing (as an alternative to IsProbPrime).
Related issues
History
#1
Updated by John Abbott about 6 years ago
Updated by - Status changed from New to In Progress
- Assignee set to John Abbott
- % Done changed from 0 to 50
JAA has checked in a first impl (using KISS philosophy).
Anna will test it shortly.
The idea is that fns which offer guaranteed or probably-correct impls offer the user an optional final arg to say which to use (and how much checking to do if the probably-correct impl is used).
Currently the VerificationLevel must be non-negative; 0 means do not perform any verification checks to the result.
As a special case the function guaranteed() produces a special "negative" verification level; this should be teh default value for the optional arg (and it indicates that the guaranteed-correct algorithm should be used).
#2
Updated by Anna Maria Bigatti about 6 years ago
Updated by - Related to Slug #1165: MinPoly over QQ: verification may be very slow added
#3
Updated by John Abbott almost 6 years ago
- Related to Design #1159: Add global enum "verify/DontVerify" added
#4
Updated by Anna Maria Bigatti over 5 years ago
- Status changed from In Progress to Closed
- % Done changed from 50 to 100
- Estimated time set to 2.01 h
Made and used for MinPoly.
(and documented, by John Abbott)
#5
Updated by Anna Maria Bigatti over 5 years ago
- Related to Slug #866: implicit, ImplicitHypersurface: improve output verification added