Timeline for Pcross-like, nonogram-like in near-linear time [closed]
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 4, 2015 at 4:12 | history | closed |
Stefan Kohl♦ Wolfgang Karl Schwede Peter Humphries Yoav Kallus |
Needs details or clarity | |
| Dec 3, 2015 at 18:15 | comment | added | JMP | so like conceptispuzzles.com/index.aspx?uri=puzzle/pic-a-pix; but the problems there have a unique solution, and you want to know given U,V vectors how many solutions there are? | |
| Dec 3, 2015 at 18:04 | comment | added | Steve Xibalba Rivieccio | If you see en.m.wikipedia.org/wiki/Discrete_tomography the problem is right that. Now the question is: exists an algorithm that say me the maximum number of admissible point (according to the rule) that runs in linear or near-linear time? I see erdos-gallai but works only with one sequence of integers. In this case I have two sequence (row and col) and they are bipartite. | |
| Dec 3, 2015 at 17:54 | comment | added | JMP | i don't understand your question. what are the placed points? | |
| Dec 3, 2015 at 14:27 | review | Close votes | |||
| Dec 4, 2015 at 4:12 | |||||
| Dec 3, 2015 at 14:02 | review | First posts | |||
| Dec 3, 2015 at 14:11 | |||||
| Dec 3, 2015 at 14:01 | history | asked | Steve Xibalba Rivieccio | CC BY-SA 3.0 |