These are by far not most, nor most of the practically useful ones. Directed graph reachability, given an adjacency list as input, is NL-hard.
1,089 karma · joined June 11, 2013
You can reach me at @robryk:wuatek.is
These are by far not most, nor most of the practically useful ones. Directed graph reachability, given an adjacency list as input, is NL-hard.
E: The obvious way to fix this is to stop talking about messages existing/not existing, but talk in terms of messages being stored in X (or having been deleted from X), for some value of X.
This seems false? The trie contained also strings like `WAYLAND_DISPLAY=`, so IIUC the backdoor would remain dormant if someone tried to run sshd from something that looks like an interactive session.
At the beginning you mention a ToF sensor, which made me think that you're looking at reflections from the bends and measuring distance to them, but this seems not to be the case. ISTM that if you bend the sensor in two places, you'll simply get the sum of the logattenuations from both. If we assume that the "strength" of the bend continuously changes attenuation, ISTM that you need as many strands as there are gap locations to be able to disambiguate between any two sets of bends.
Am I misreading something or is this intended to operate in cases where we know only one bend is present?
E: see RFC 4253, sections 8 and 10, and RFC 4252 for corroboration
Sadly, this is a rare approach, so if you cooperate with others it's hard to use it.
> It's roughly equivalent to flying at 40,000 ft on Earth with an electric helicopter. The world record for highest helicopter ever flown is 42,500 ft on Earth.
The record was established in a jet-engined helicopter, whose service ceiling is largely a function of engine power at appropriate altitudes (e.g. it varies a lot with temperature and humidity).