NP complete and poly-time reducation Job ID: 30641380 Budget: $10 – $30 USD prove that a problem is NP and NP-complete Related categories: Linear Programming / Computer Science