Timeline for Enumerating (generalized) de Bruijn tori
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Sep 25, 2013 at 13:28 | history | suggested | Turbo |
From the OP's comment, the problem looks like it has relations to One way functions in Cryptography
|
|
| Sep 25, 2013 at 13:24 | review | Suggested edits | |||
| S Sep 25, 2013 at 13:28 | |||||
| Sep 25, 2013 at 13:10 | comment | added | Turbo | Could you explain what is the exact relation? I tried reading Levin's paper and I could not understands the tiling expansion problem clearly. | |
| Sep 17, 2010 at 18:27 | comment | added | Steve Huntsman | I just realized that this is likely to be very hard indeed, as it appears related to Levin's universal one-way "tiling expansion" function. See arxiv.org/abs/cs.CR/0012023 | |
| Jan 5, 2010 at 0:43 | history | edited | Steve Huntsman | CC BY-SA 2.5 |
added 119 characters in body; added 16 characters in body
|
| Jan 5, 2010 at 0:31 | history | edited | Steve Huntsman | CC BY-SA 2.5 |
added 132 characters in body; deleted 55 characters in body; edited body
|
| Jan 5, 2010 at 0:20 | history | asked | Steve Huntsman | CC BY-SA 2.5 |