Timeline for The NP version of Matiyasevich's theorem
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 27, 2013 at 21:02 | comment | added | François G. Dorais | @LevDub, it's not quite two years but it has been long enough that I don't remember the proofs. I don't have access to the paper right now but I will try to dig it up when I'm back at the office next week. | |
| Jun 27, 2013 at 19:22 | comment | added | GMB | @FrançoisG.Dorais: I know I'm two years late to this thread, but I was hoping to ask you a couple questions. I am very interested in the two NDDM/NDTM time bounds you listed above, and I would like to read the proof, but unfortunately all copies of Diophantine Complexity are behind a paywall. (1) Is the proof of the timebounds given in the DC paper instructive enough to be worth purchase? and (2) are you aware of any other freely available paper that contains these proofs? Thanks so much. | |
| Jul 20, 2011 at 14:57 | history | edited | François G. Dorais | CC BY-SA 3.0 |
addendum
|
| Jul 20, 2011 at 14:37 | comment | added | François G. Dorais | I had missed Emil's answer while typing this. | |
| Jul 20, 2011 at 14:35 | history | answered | François G. Dorais | CC BY-SA 3.0 |