``NP\(=\)P? and restricted partitions

DOI10.1016/0020-0255(84)90036-7zbMath0548.68043OpenAlexW2052273480MaRDI QIDQ799370

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

zbMATH Keywords

NP-completenessdynamic programming algorithmrestricted partitions

Mathematics Subject Classification ID

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

Related Items (1)

A comment on \('NP=P?'\) and restricted partitions

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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