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

DOI10.1016/0020-0255(86)90029-0zbMath0605.68033OpenAlexW2033773980MaRDI QIDQ1083850

He Zhang

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0020-0255(86)90029-0

zbMATH Keywords

NPP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• ``NP\(=\)P? and restricted partitions
• The art and theory of dynamic programming
• The complexity of theorem-proving procedures

This page was built for publication: A comment on \('NP=P?'\) and restricted partitions