``NP=P? and restricted partitions

DOI10.1016/0020-0255(84)90036-7zbMATH Open0548.68043OpenAlexW2052273480MaRDI QIDQ799370FDOQ799370

Authors: N. E. Zubov 

Publication date: 1984

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(84)90036-7

Recommendations

• On the complexity of some partition problems
• scientific article; zbMATH DE number 4066629
• Decision problems for some classes of integer partitions and number multisets
• Computational complexity of the product partition problem
• scientific article; zbMATH DE number 3989105

zbMATH Keywords

NP-completenessdynamic programming algorithmrestricted partitions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Combinatorial aspects of partitions of integers (05A17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The art and theory of dynamic programming
• On the expansion of the partition functions in a series
• Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
• Title not available (Why is that?)

Cited In (7)

• A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
• New NP-hard and NP-complete polynomial and integer divisibility problems
• Computational complexity of the product partition problem
• Title not available (Why is that?)
• An algebraic expression of the number partitioning problem
• Decision problems for some classes of integer partitions and number multisets
• A comment on \('NP=P?'\) and restricted partitions

This page was built for publication: ``NP\(=\)P? and restricted partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799370)