Timeline for How does the number of self-avoiding paths between two points scale, in a square/cubic lattice?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 2, 2012 at 0:23 | comment | added | Niel de Beaudrap | Fair point; perhaps the correct statement would be that determining whether the function exceeds some threshold is conjectured to be NP-hard. I have no intuition either way, and in any case am concerned with asymptotics rather than the exact problem. | |
| Oct 1, 2012 at 19:37 | comment | added | domotorp | Not NP, #P-hard. | |
| Sep 28, 2012 at 17:24 | history | asked | Niel de Beaudrap | CC BY-SA 3.0 |