Timeline for How hard is it to compute the number of prime factors of a given integer?
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 17, 2015 at 16:43 | comment | added | Frédéric Grosshans | @D.W.: he probably writes ”easier“ with the “not more difficult” meaning | |
| Jul 31, 2015 at 6:32 | comment | added | D.W. | Why do you say this is easier than factoring? Factoring is also in BQP and in the intersection of co-NP and NP, so I'm not seeing the basis for that statement. | |
| Dec 29, 2009 at 15:15 | history | answered | Steve Flammia | CC BY-SA 2.5 |