Conference paper
Adaptive traitor tracing for large anonymous attack
Hongxia Jin, Jeffery Lotspiech, et al.
CCS 2008
Paper
On the complexity of polyhedral separability
Abstract
It is NP-complete to recognize whether two sets of points in general space can be separated by two hyperplanes. It is NP-complete to recognize whether two sets of points in the plane can be separated with k lines. For every fixed k in any fixed dimension, it takes polynomial time to recognize whether two sets of points can be separated with k hyperplanes. © 1988 Springer-Verlag New York Inc.
Related
Conference paper
Discovering Predictive Association Rules
Nimrod Megiddo, Ramakrishnan Srikant
KDD 1998
Felix Naumann, Ching-Tien Ho, et al.
Proceedings - International Conference on Data Engineering
Conference paper
Strategic classification
Moritz Hardt, Nimrod Megiddo, et al.
ITCS 2016