Skip to content
Better HN
Top
Best
Ask
Show
New
Jobs
Search
⌘K
0 points
DanWaterworth
10y ago
0 comments
Save
Share
I think it's worth trying. I'm not confident that it would be faster, but perhaps a SAT-solver would be able to more efficiently prune the search space meaning fewer random accesses.
0 comments
1 comments · 1 top-level
top
newest
oldest
tromp
10y ago
That seems backwards. The random memory accesses are used to prune the search space.
j
/
k
navigate · click thread line to collapse