Geodesic
On the Complexity of Polyhedral Separability.
Discrete & computational geometry, Tome 3 (1988) no. 1-2, pp. 325-338.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : complexity, polyhedral separability, computational geometry, linear separability problem 
@article{DCG_1988__3_1-2_131054,
     author = {N. Megiddo},
     title = {On the {Complexity} of {Polyhedral} {Separability.}},
     journal = {Discrete & computational geometry},
     pages = {325--338},
     publisher = {mathdoc},
     volume = {3},
     number = {1-2},
     year = {1988},
     zbl = {0669.68035},
     url = {http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131054/}
}
TY  - JOUR
AU  - N. Megiddo
TI  - On the Complexity of Polyhedral Separability.
JO  - Discrete & computational geometry
PY  - 1988
SP  - 325
EP  - 338
VL  - 3
IS  - 1-2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131054/
ID  - DCG_1988__3_1-2_131054
ER  - 
%0 Journal Article
%A N. Megiddo
%T On the Complexity of Polyhedral Separability.
%J Discrete & computational geometry
%D 1988
%P 325-338
%V 3
%N 1-2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131054/
%F DCG_1988__3_1-2_131054
N. Megiddo. On the Complexity of Polyhedral Separability.. Discrete & computational geometry, Tome 3 (1988) no. 1-2, pp. 325-338. http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131054/