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
Number partitioning
مسأله تقسیم‌بندی

🌐فارسی

English Deutsch Español Français Italiano Nederlands Polski Português Русский فارسی 한국어 中文

EntityQ1065968· pop 13· linked from 41 articles

مسأله تقسیم‌بندی

NP-complete problem in computer science

Available in 13 languages

Español
Français
Deutsch
中文
Русский
Português
Czech
Nederlands
Polski
Ukrainian

Connections

computer science

International Standard Book Number

Categories

Number partitioning Weakly NP-complete problems

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

public election

Entity

digital object identifier

International Standard Serial Number

binary search algorithm

dynamic programming

birthday problem

P versus NP problem

depth-first search

partition of a set

significant figure

Sign in to save

What links here41 pages

change-making problem

matrix chain multiplication

subset sum problem

ant colony optimization algorithms

bin packing problem

pseudo-polynomial time

partition of a set

birthday problem

graph partition

strong NP-completeness

Karp's 21 NP-complete problems

integer partition

Similar entities

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

Heap's algorithm

Entitydist 0.58

Entitydist 0.65

Graham's number

Entitydist 0.65

largest remainder method

Entitydist 0.65

problem of points

Entitydist 0.67

Donald G. Saari

Entitydist 0.67

Boyer-Moore Majority Vote Algorithm

Entitydist 0.68

complete sequence

Entitydist 0.69

Erdős distinct distances problem

Entitydist 0.69

Entitydist 0.69

optimum population

Entitydist 0.70

Entitydist 0.70