Paramita Pal

Rated 4.50(8) — Paramita Pal

NP-hard (Non-deterministic Polynomial-time hard), in computational complexity theory, is a class of problems that are, "at least as hard as the hardest problems in NP". And any given solution to an NP-complete problem can be verified quickly (in polynomia

Rated 4.33(95) — Paramita Pal

In India, the most used tax saving clause is section 80C, which gives you the opportunity to save tax for income upto Rs. 1,50,000. This covers a lot of spectrum like EPF, PPF, NPS and Term/Endowment Insurance plans.Out of all these options, most of...