Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

مسئله جمع زیرمجموعه‌ها · Vinony

Home
Dynamic programming
مسئله جمع زیرمجموعه‌ها

🌐فارسی

English Deutsch Español Français Polski Português Türkçe Русский العربية فارسی 한국어 中文日本語

EntityQ1154420· pop 17· linked from 50 articles

مسئله جمع زیرمجموعه‌ها

decision problem in computer science

Available in 17 languages

Español
Français
Deutsch
中文
日本語
Русский
Português
العربية
Hebrew

Connections

time complexity

brute-force search

Categories

Dynamic programming Weakly NP-complete problems

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

Michael Garey

Entity

computer science

International Standard Book Number

digital object identifier

International Standard Serial Number

Internet Archive

sorting algorithm

dynamic programming

depth-first search

breadth-first search

search algorithm

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

weighted sum model

Entitydist 0.46

selection algorithm

Entitydist 0.47

Entitydist 0.56

repeated combination

Entitydist 0.58

binary decision diagram

Entitydist 0.58

Boolean network

Entitydist 0.58

Entitydist 0.60

decision tree model

Entitydist 0.61

Institute of Combinatorics and its Applications

Organizationdist 0.63

Entitydist 0.64

Znám's problem

Entitydist 0.64

Entitydist 0.65

What links here50 pages

glossary of group theory

P versus NP problem

optical computer

zero-sum problem

Merkle–Hellman knapsack cryptosystem

trapdoor function

glossary of artificial intelligence

Karp's 21 NP-complete problems

string theory landscape

partition problem

Waring's problem

homomorphic encryption

knapsack problem

maximum subarray problem

one-way function