
About:Measure of the resources needed to run an algorithm or solve a problem.
Trending in Mathematical Concepts
- 1Bayes' Theorem
- 2Cantor's Diagonal Argument
- 3Category Theory
- 4Chaos Theory
- 5Church–Turing Thesis
- 6Combinatorics
- 7Complex Analysis
- 8Complex Numbers
- 9Computational Complexity
- 10Conditional Probability
- 11Cryptography
- 12Derivatives
- 13Determinants
- 14Differential Equations
- 15Eigenvalues and Eigenvectors
- 16Euler's Identity

About:Measure of the resources needed to run an algorithm or solve a problem.
Hardness proved for the decision version and quoted for the optimisation problem
Lectures establish that deciding whether a solution of a given cost exists is hard, and then hardness gets cited casually for the problem of finding the best solution. The relationship between the two is real but it deserves a statement, not a silent slide. Students copy the slide and lose the distinction.
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.