2 citations · 5 across the 8 of their papers we have counts for
1 paper · 1 filter
Andrew Shallue, Jonathan Webster
Our primary concern is the computational complexity of algorithms that find all Carmichael numbers less than some specified bound B. We have three related results. First, we show…