Decision problems for some classes of integer partitions and number multisets

DOI10.1007/S10958-011-0283-0zbMATH Open1282.68129OpenAlexW2032164697MaRDI QIDQ389094FDOQ389094

Authors: Vladimir A. Shlyk 

Publication date: 17 January 2014

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-011-0283-0

Recommendations

• ``NP\(=\)P? and restricted partitions
• On a communication complexity problem in combinatorial number theory
• On the equal-subset-sum problem
• Some Complexity Issues In A Class Of Knapsack Problems: What Makes A Knapsack Problem “Hard”?
• scientific article; zbMATH DE number 3876925

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Möbius function of partitions with restricted block sizes
• Polytopes of partitions of numbers
• Combinatorial operations for the generation of vertices of integer partition polytopes
• A criterion for the representation of partitions of numbers as a combination of two partitions
• Title not available (Why is that?)
• Srinivasa Ramanujan (1887-1920) and the theory of partitions of numbers and statistical mechanics. A centennial tribute

Cited In (5)

• Title not available (Why is that?)
• On some similarity of finite sets (and what we can say today about certain old problem)
• ``NP\(=\)P? and restricted partitions
• On a communication complexity problem in combinatorial number theory
• On sets related to integer partitions with quasi-required elements and disallowed elements

This page was built for publication: Decision problems for some classes of integer partitions and number multisets

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