On the number of linearly separable subsets of finite sets in Rn

Discrete and Computational Geometry

Volumn 18, Issue 4, 1997, Pages 463-472

  Gulliksen, T ^a   Hole, A ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031479246     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009329     Document Type: Article

References (6)

1. K. Clarkson and P. Shor, Applications of random sampling to computational geometry, II Discrete Comput. Geom. 4 (1989), 387-421.
2. T. M. Cover, Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition, IEEE Trans. Electron. Comput., 14 (1965), 326-334.
3. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin (1987).
4. B. Grünbaum, Convex Polytopes, Wiley (1967).
5. J. Harris, Algebraic Geometry, Springer-Verlag, New York (1992).
6. M. Sharir, k-Sets and random hulls, Combinatorica, 13 (1993), 483-495.