Timeline for Computing the Mobius function
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jan 3, 2017 at 11:09 | history | suggested | CommunityBot | CC BY-SA 3.0 |
corrected parentheses, and mu(n) = 0 iff n is not squarefree.
|
| Jan 3, 2017 at 0:53 | review | Suggested edits | |||
| S Jan 3, 2017 at 11:09 | |||||
| Dec 5, 2011 at 23:36 | comment | added | Sasho Nikolov | do you know any papers that discuss the complexity of square-freeness? all i could find is this: dl.acm.org/citation.cfm?id=371327&dl=GUIDE&coll=GUIDE, which gives formula size lower bounds. looking at mathoverflow.net/questions/16098/…, i think not much is known about whether it's likely to be able to reduce factoring to square freeness. | |
| Nov 29, 2011 at 18:21 | history | answered | Suresh Venkat | CC BY-SA 3.0 |