Timeline for Computational complexity of modular power towers (tetration)
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 19, 2015 at 23:51 | answer | added | Zsbán Ambrus | timeline score: 6 | |
| Jun 19, 2015 at 23:24 | comment | added | Ross Snider | Edited the comment to specify $n = |N|$. Thank you for helping to clarify. Please let me know if the question needs some additional clarification. | |
| Jun 19, 2015 at 23:23 | history | edited | Ross Snider | CC BY-SA 3.0 |
added 6 characters in body
|
| Jun 19, 2015 at 23:15 | comment | added | Ross Snider | I did take a shortcut in notation, though it is standard and should be understandable based on the context of the question. n is the length of the input (number of digits in the modulus). | |
| Jun 19, 2015 at 22:48 | comment | added | Zsbán Ambrus | Your notation seems unclear. What does $ n $ mean in $ O(M(n)k) $? Is $ n $ the modulus? | |
| Jun 19, 2015 at 21:54 | history | edited | Ross Snider | CC BY-SA 3.0 |
added 58 characters in body
|
| Jun 19, 2015 at 21:37 | history | asked | Ross Snider | CC BY-SA 3.0 |