Timeline for On variant of integer factorization
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Nov 2, 2015 at 9:08 | comment | added | Igor Rivin | @joro Ah, I see... | |
| Nov 2, 2015 at 7:30 | comment | added | joro | @IgorRivin The problem is that the number of divisors may be exponential. I believe one can assume the factorization of $n$ is given. | |
| Nov 2, 2015 at 0:54 | comment | added | Turbo | no this is not arithmetical at all, you can factorize into primes which are small but $m$ needs to be pieced together (this last step is not at all arithmetical) into a factor which is exponential in compared to any of prime factors | |
| Nov 2, 2015 at 0:31 | review | Close votes | |||
| Nov 3, 2015 at 5:29 | |||||
| Nov 2, 2015 at 0:28 | comment | added | Gerry Myerson | Factorization is factorization. It's still arithmetical, not combinatorial. | |
| Nov 2, 2015 at 0:25 | history | edited | Turbo | CC BY-SA 3.0 |
deleted 67 characters in body
|
| Nov 2, 2015 at 0:24 | comment | added | Turbo | @IgorRivin Check out answer and comments in link included in post | |
| Nov 1, 2015 at 22:40 | comment | added | Turbo | This is a variant of factorization $m$ need not be prime. | |
| Nov 1, 2015 at 22:13 | comment | added | Igor Rivin | I don't understand - it is not even known that factorization is NP-complete. | |
| Nov 1, 2015 at 20:57 | history | asked | Turbo | CC BY-SA 3.0 |