Timeline for References about deriving the complexity of a given algorithm
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2021 at 9:41 | history | edited | glS♦ | CC BY-SA 4.0 |
edited title
|
| Sep 21, 2021 at 14:22 | vote | accept | John Parker | ||
| Sep 18, 2021 at 13:24 | answer | added | epelaez | timeline score: 1 | |
| Sep 18, 2021 at 13:09 | history | edited | epelaez |
edited tags
|
|
| Sep 17, 2021 at 19:13 | comment | added | Bertrand Einstein IV | If you're just looking for general advice on approaching Quantum Complexity; first obviously tackle some Classical Complexity. Then get comfortable with Grover Searches, Quantum Counting, Amplitude Amplification, Quantum Walks, etc. And from there you can approach any specific algorithm whose complexity is almost always analyzed in the paper the algorithm is introduced in. For actual analysis of upper/lower bounds The Adversarial Method and The Polynomial Method are often used. | |
| Sep 17, 2021 at 19:02 | comment | added | jecado | Could you clarify the scope of your question? For example, are you asking about the concept of algorithmic complexity and big-O notation, or are you are asking about the details of each individual algorithm? | |
| Sep 17, 2021 at 18:02 | history | asked | John Parker | CC BY-SA 4.0 |