On the complexity of some partition problems
From MaRDI portal
Publication:1386936
zbMATH Open0899.05005MaRDI QIDQ1386936
Publication date: 8 November 1998
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Partitions of sets (05A18) Circuits, networks (94C99)
Related Items (11)
A comment on \('NP=P?'\) and restricted partitions ⋮ Well-solvable instances for the partition problem ⋮ Problems and results on judicious partitions ⋮ Title not available (Why is that?) ⋮ The unbiased black-box complexity of partition is polynomial ⋮ Open Problems in Partition Regularity ⋮ Relaxed complete partitions: an error-correcting Bachet's problem ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences ⋮ On the complexity of assembly partitioning
This page was built for publication: On the complexity of some partition problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386936)
