Home
Blogs
Bookmarks
Forums
Search

Author

Write
Drafts

New
Bug0 - The AI-native e2e QA regression testing Passmark - The open-source AI framework for regression testing Changelog Brand @hashnode on X Hashnode on LinkedIn Code of Conduct Support - hello+support@hashnode.com
Sign in

Terms Privacy Sitemap

© 2026 LinearBytes Inc.

Search Hashnode

Search posts, tags, users, and pages

#polynominal-time | Hashnode

Tag feed

#polynominal-time

1 posts·0 followers

Articles Threads

Trending tags this week

Trending tags this week

1#ai 362
2#javascript 110
3#security 85
4#python 80
5#webdev 77
6#machinelearning 73
7#devops 73
8#machine-learning 64
9#deeplearning 63
10#risingwave 63
11#artificial-intelligence 62
12#cybersecurity 62
13#computerscience61
14#programming 58

RMRasel Mahmudinprogramming-dude.com

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

Nov 16, 2024 · 2 min read · 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...

Join discussion