Complex sentence: Most versions of the Steiner tree problem are NP-hard, but some restricted cases can be solved in polynomial time.
Split into simpler sentences: Most versions of the Steiner tree problem are NP-complete. Some restricted cases can be solved in polynomial time.