Home
Feed

Extend

Hashnode Pro
Hashnode for Agents

Resources

The foreword
Hashnode gql skill

Buildful - AI coding agent that delivers frontier-level results at a fraction of the cost Bug0 - The AI-native e2e QA regression testing Hackathons Changelog Brand @hashnode on X Hashnode on LinkedIn Support - hello+support@hashnode.com Code of Conduct Terms Privacy Sitemap

Sign in

Search Hashnode

Search posts, tags, users, and pages

Discussion on "Key differences between P, NP, NP-complete, and NP-hard" | Hashnode

Discussion

Rasel Mahmud

I'm the author of Programming Dude || Aspiring Machine Learning Engineer

Nov 16, 2024

Key differences between P, NP, NP-complete, and NP-hard

CategoryPNPNP-completeNP-hard DefinitionProblems that can be solved in polynomial time by a deterministic algorithm.Problems whose solutions can be verified in polynomial time by a deterministic algorithm.Problems that are both in NP and as hard a...

ai-eng.hashnode.dev2 min read

#polynominal-time #np-complete #np-hard #algorithm #design-patterns #optimization

Responses

Markdown supported · ⌘↵ to post

No responses yet.