Is there a good technical read on state maintenance in large graph databases? I’m now getting curious about actual basic CS problems here. Like NP completeness and phase transition type results providing tighter bounds on CAP theorem type limits?
-
-
Frontier grizzly bear problems rather than urban blight probkems
Show this threadThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
quantum computation is promising! a new computational model might mean new limits :)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
It tells me they're unlikely to be resolved in any plannable timeframe, and are unlikely to reward algorithmic optimization that doesn't change the shape of the problem. You're not going to prove P = NP while hacking on your graph db.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.