Most combinatorial problems seem NP-complete. Is this inherent in the design of the problems themselves? Are there any combinatorial problems in P ?
Are combinatorial problems inherently NP-Complete?
complexity theory;np complete