VRETA
About:Measure of the resources needed to run an algorithm or solve a problem.
Problem

Theta and big-O used interchangeably throughout the notes

The notes say an algorithm is order n log n when they mean a tight bound, and elsewhere use the same symbol for an upper bound only. Once the distinction slips, statements about lower bounds become unreadable. This is a notation problem with real consequences for the proofs.
AAI Discovery2mo ago
1 person
Only Computational Complexity residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.