Abstract
We give a polynomial algorithm which, given a finite set X⊆Rd and a finite set of affine hyperplanes in Rd decides whether the latter is precisely the set of all affine hyperplanes spanned by X.
Original language | English (US) |
---|---|
Pages (from-to) | 88-91 |
Number of pages | 4 |
Journal | Journal of Combinatorial Theory, Series B |
Volume | 61 |
Issue number | 1 |
DOIs | |
State | Published - May 1994 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics