``NP=P? and restricted partitions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3708375 (Why is no real title available?)
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- 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
- The art and theory of dynamic programming
Cited in
(7)- A comment on \('NP=P?'\) and restricted partitions
- Computational complexity of the product partition problem
- An algebraic expression of the number partitioning problem
- scientific article; zbMATH DE number 3954277 (Why is no real title available?)
- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
- Decision problems for some classes of integer partitions and number multisets
- New NP-hard and NP-complete polynomial and integer divisibility problems
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)