Looking at this wiki page, it seems most NP-complete problems are based on discrete structures, such as graphs. What are some problems that involve real or complex analysis instead of discrete analysis? If none, why not?
closed as off-topic by D.W., Aryeh, Kaveh, Emil Jeřábek supports Monica, Bruno Feb 11 '18 at 18:14
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center. Your question might be suitable for Computer Science which has a broader scope." – D.W., Aryeh, Kaveh, Emil Jeřábek supports Monica, Bruno