|
|
|
|
|
|
by nabla9
2552 days ago
|
|
|
Grover's algorithm still takes exponentially many operations to solve a search problem that can be brute-forced in exponentially many steps. Much faster, but still in EXPTIME. No jump from exponential to polynomial complexity class. |
|
|