I'd say it instead makes it more precise, indicating that they are uncertain but the range is from several hours to days.
There are such things, they are called "arxiv overlay journals". Couple of examples from my research area: https://www.advancesincombinatorics.com/, https://theoretics.episciences.org/
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.
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 hardness result for complexity classes would…
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
arxiv.org
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 magnitudes larger than the funding used…
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 yet rule out the possibility that…
One useful piece of advice that I have received is that there are tradeoffs in giving shit at work. This article mentions downsides of not giving a shit, but doesn't mention downsides of giving too much shit, that is,…
Ah, that explains it perfectly!
Most research is government funded
All Turing-complete programming languages/models of computation can simulate each other with polynomial overhead. What I think is weird is that the article specifically mentions that programming languages are built on…
Oh, that's nice, I didn't know that! How big is your office? What I know is that Google does not hire software engineers in Helsinki. They have a small office, but it is only for sales people. Edit: Also by…
Is there something wrong in this? Better qualified candidates were preferred for a research job. Of course, if you argue that the job didn't actually require PhD-level knowledge/experience, then the problem is in…
Trading in microseconds frequency provides liquidity to those who trade in milliseconds frequency. Trading in milliseconds frequency provides liquidity to those trading in seconds frequency and so on...
Computer science is not a subfield of math. Theoretical computer science is, but there is a lot more to cs than just tcs, for example: operating systems, programming languages, human computer interaction, etc. I agree…
I was expecting it to a have a section about deep learning hype.
They have hired with algorithm questions since the beginning and started with behavioral questions in 2018...
It's easy to throw hardware at a problem that can be parallelized efficiently. It's very hard to throw hardware at inherently sequential solution.
Why C++ string class is useless?
SAT competition 2018 http://sat2018.forsyte.tuwien.ac.at/index.php had a track with random instances. The article "Generating the Uniform Random Benchmarks" in…
I'd say it instead makes it more precise, indicating that they are uncertain but the range is from several hours to days.
There are such things, they are called "arxiv overlay journals". Couple of examples from my research area: https://www.advancesincombinatorics.com/, https://theoretics.episciences.org/
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.
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 hardness result for complexity classes would…
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
arxiv.org
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 magnitudes larger than the funding used…
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 yet rule out the possibility that…
One useful piece of advice that I have received is that there are tradeoffs in giving shit at work. This article mentions downsides of not giving a shit, but doesn't mention downsides of giving too much shit, that is,…
Ah, that explains it perfectly!
Most research is government funded
All Turing-complete programming languages/models of computation can simulate each other with polynomial overhead. What I think is weird is that the article specifically mentions that programming languages are built on…
Oh, that's nice, I didn't know that! How big is your office? What I know is that Google does not hire software engineers in Helsinki. They have a small office, but it is only for sales people. Edit: Also by…
Is there something wrong in this? Better qualified candidates were preferred for a research job. Of course, if you argue that the job didn't actually require PhD-level knowledge/experience, then the problem is in…
Trading in microseconds frequency provides liquidity to those who trade in milliseconds frequency. Trading in milliseconds frequency provides liquidity to those trading in seconds frequency and so on...
Computer science is not a subfield of math. Theoretical computer science is, but there is a lot more to cs than just tcs, for example: operating systems, programming languages, human computer interaction, etc. I agree…
I was expecting it to a have a section about deep learning hype.
They have hired with algorithm questions since the beginning and started with behavioral questions in 2018...
It's easy to throw hardware at a problem that can be parallelized efficiently. It's very hard to throw hardware at inherently sequential solution.
Why C++ string class is useless?
SAT competition 2018 http://sat2018.forsyte.tuwien.ac.at/index.php had a track with random instances. The article "Generating the Uniform Random Benchmarks" in…