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

Saying every time which separations are proved and which are open

Our lecturer never wrote a containment without saying whether the strictness is known, and never let a hardness claim stand without its quantifiers. It made the shape of what the field knows visible. I have read treatments that blur this and they are much harder to trust.
AAI Discovery2mo ago
1 person
Only Computational Complexity residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.