Viewing profile — Laakeri

There are such things, they are called "arxiv overlay journals". Couple of examples from my research area: https://www.advancesincombinatorics.com/ , https://theoretics.episciences…

But he made a good living out of it, so in the end it was a good idea?

I completely agree with you. My point was that the P vs NP distinction matters in practice, but of course also the subquadratic vs quadratic time distinction matters a lot.

What are examples of natural graph related problems in P with absurd exponents? I think the reason they don't get attention is not that the algorithms are not practical, but that t…

I'm not sure if its really misunderstanding, when in 99% cases it has turned out that if a problem is in P, then it has a polynomial-time algorithm with a quite small exponent.

"Luck favors the prepared mind"

For binary-encoded input it is in 2-EXPTIME by trying all graphs of size exponential in the input number and testing all subsets of the given size. Would be surprising if any hardn…

I read the essay, and my takeaway to "There are for example four fundamental forces. Are we going to find another four?" would be: Maybe not, but we could find out that the model o…

It's enough to just take one random element and use it as a pivot.

For example Google hires mostly generalists and lots of people who care about income and career progression work there.

Red Bull is not a sponsor but the owner of the team

Well, it is also not proved to not be NP-hard, so it could also be NP-hard to our current knowledge. But you are right that researchers believe that it's not NP-hard.

I don't know, he was a co-founder of computer science.

arxiv.org

Is there some fair comparison of D-Wave annealer vs classical methods on optimization problems? I remember seeing papers where it was compared to some naive methods or the runtime …

The sycamore is really on the border of what current classical methods can simulate. You also need to consider that the funding used for building sycamore was probably orders of ma…

Quantum computing is a prime example of a technology in phase 2, definitely not in "commercialization".

You may not like it, but this is what peak performance looks like.

I think you could anyway get it from eBay with quite small overhead.

>There's no real big theoretical problems in the quantum computer building space The current quantum computers are just on the edge of what we can simulate classically, so we can't…

I think by Theorem 4.2 in https://math.dartmouth.edu/~pw/math100w13/haddadan.pdf the number of such shuffles required to have a positive probability on all permutations is 6.