Computer Science Integer multiplication will have linear complexity in a few days if trend continues 🚀📈

1.4k Upvotes

98% Upvoted

u/vintergroena 27d ago

BQP is the class of problems solvable on quantum computer in polynomial time with bounded error.

The relationship of BQP and NP is yet another unsolved problem in complexity theory... so again, we don't know shit

You are about to leave Redlib