id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
16964,Speed up comparisons in QQbar,Martin von Gagern,,"When computing the variety of some ideal, then excessive amounts of time are apparently spent sorting the solutions. (In one example, the variety was essentially computed in 7½ hours but the sorting wasn't finished even 1½ hours after that.) This is due to the fact that comparison between complex algebraic numbers is done lexicographically, which means that quite often the real parts of complex conjugate numbers will have to be compared for equality, which can be a very costly operation.
Originally the computation even resulted in a Pari exception (“not enough precomputed primes”). This no longer occurs (since the pari upgrade from #15767). So the focus of this ticket is now the excessive amount of time required for comparisons, even without an exception.",defect,closed,critical,sage-6.5,number fields,fixed,variety qqbar cmp singular,,,Martin von Gagern,Vincent Delecroix,N/A,,3f4afef46ab6a042cb2678394031cb5c26d89b1a,3f4afef46ab6a042cb2678394031cb5c26d89b1a,,