Timeline for Computational complexity of solution of Pell equation and more
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 13, 2014 at 3:10 | vote | accept | XL _At_Here_There | ||
| Apr 29, 2014 at 9:46 | comment | added | XL _At_Here_There | It jumps from p of $ax+by=c$ to NPC of $ax^2+by=c$ | |
| Apr 29, 2014 at 5:35 | comment | added | Gerry Myerson | @Bjørn, I wouldn't call it a Pell equation. It's in reference to the second paragraph of the question XL posted, which was about "computable Diophantine equations" generally. | |
| Apr 29, 2014 at 5:16 | comment | added | Bjørn Kjos-Hanssen | Is that a Pell equation or just a simple Diophantine equation? | |
| Apr 29, 2014 at 5:13 | comment | added | Gerry Myerson | @Bjørn, no --- what I wrote is what it says in Garey and Johnson. | |
| Apr 29, 2014 at 3:03 | history | answered | Gerry Myerson | CC BY-SA 3.0 |