Viewing profile — zschoche

Quick question: what are the NP-hard problems in the database area?

It would be great if someone could precisely define what is the goal we would like to optimize. In mathematical terms.

Nit: if number n is given in binary representation in the input, then an O(n)-algorithm runs in exponential time as n is an exponential function of log(n). Hence, log(n)^O(1)-time …

Well, it always depends on what you lookup i.e. how much time one needs to compute entries of the given lookup table. If it takes O(2^n) time , then payback comes quickly, where n …

Okay let (P,k) be a parameterized problem which admits a fixed-parameter algorithm with respect to k. That means you have an algorithm which runs in f(k)n time, where n is the inpu…

if a problem is NP-hard does not mean that each instance is hard to solve. From my experience many instances appearing in practice are easy to solve even if there very large. The p…

In most cases, lambdas are rvalues. That can have an impact on its scope and lifetime.

There is nothing native. Go home and read a books.

It looks like they understand memory as a tree, but in complex structures it's a graph. I couldn't found how they handle ring topologies. I guess, this stealing stuff doesn't help.…

Decades ago albert einstein introduced the general theory of relativity, which is already telling us that timestamps are bad for synchronisation.

Not sure what is meant by "research". It would be nice to justify statements. To write something in upper cases isn't a justification and doesn't make sense. Each new programming l…

Go - Like

C++ - Like

Why exactly does need this app access to all my data at google? Scary