WikiLean

Diff — Quadratic sieve

Revision #5620 → #6026 · back to history

modifiedQuadratic sieve18da09b404b5
FieldFrom #5620To #6026
links[{"id":"18da09b404b5:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Quadratic_sieve&oldid=1325108550","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"The quadratic sieve algorithm ( QS ) is an integer factorization algorithm"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"Nat.factorization","module":"Mathlib.Data.Nat.Factorization.Defs"}}]}}][{"id":"18da09b404b5:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Quadratic_sieve&oldid=1384251259","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"The quadratic sieve algorithm ( QS ) is an integer factorization algorithm"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"Nat.factorization","module":"Mathlib.Data.Nat.Factorization.Defs"}}]}}]
modifiedQS practical speedaaeb27457641
FieldFrom #5620To #6026
unlinked[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Quadratic_sieve&oldid=1325108550","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"in practice, the second-fastest method known"},"resolution":"not_attempted"}}][{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Quadratic_sieve&oldid=1384251259","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"in practice, the second-fastest method known"},"resolution":"not_attempted"}}]
modifiedQS under 100 digits41b80a32a29e
FieldFrom #5620To #6026
unlinked[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Quadratic_sieve&oldid=1325108550","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"It is still the fastest for integers under 100 decimal digits"},"resolution":"not_attempted"}}][{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Quadratic_sieve&oldid=1384251259","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"It is still the fastest for integers under 100 decimal digits"},"resolution":"not_attempted"}}]
modifiedGeneral-purpose factorization algorithmf613d12777c6
FieldFrom #5620To #6026
links[{"id":"f613d12777c6:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Quadratic_sieve&oldid=1325108550","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"It is a general-purpose factorization algorithm"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"Nat.factorization","module":"Mathlib.Data.Nat.Factorization.Defs"}}]}}][{"id":"f613d12777c6:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Quadratic_sieve&oldid=1384251259","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"It is a general-purpose factorization algorithm"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"Nat.factorization","module":"Mathlib.Data.Nat.Factorization.Defs"}}]}}]
modifiedGeneral-purpose running time dependence70c011ccd012
FieldFrom #5620To #6026
links[{"id":"70c011ccd012:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Quadratic_sieve&oldid=1325108550","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"its running time depends solely on the size of the integer to be factored"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"AkraBazziRecurrence","module":"Mathlib.Computability.AkraBazzi.SumTransform"}}]}}][{"id":"70c011ccd012:link:0","annotation":{"subject":[{"type":"html","uri":"https://en.wikipedia.org/w/index.php?title=Quadratic_sieve&oldid=1384251259","location":{"profile":"urn:wikilean:anchor:v3","anchor":{"section":"(Lead)","snippet":"its running time depends solely on the size of the integer to be factored"},"resolution":"not_attempted"}}],"object":[{"type":"lean","uri":"https://github.com/leanprover-community/mathlib4","location":{"declaration":"AkraBazziRecurrence","module":"Mathlib.Computability.AkraBazzi.SumTransform"}}]}}]