The inverse relationship between Zeroing Algorithm runtime and Q_0(r)
Statement
Let be the quantity associated with the initial polynomial in the Zeroing Algorithm, and let the run-time denote the number of steps taken by that algorithm.
Inverse-relationship conjecture. and the run-time have an inverse relationship.
This conjecture is motivated by simulations and by the preceding theorem, which suggests that the run-time becomes unbounded as . The source does not specify a precise functional meaning of “inverse relationship” or provide a proved bound.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.