The hardness of data packing
From MaRDI portal
Publication:2828259
DOI10.1145/2837614.2837669zbMath1347.68172OpenAlexW2295173494MaRDI QIDQ2828259
Publication date: 24 October 2016
Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2837614.2837669
Mathematical problems of computer architecture (68M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items