On the Complexity of Polyhedral Separability.
Megiddo, N.
Discrete & computational geometry, Tome 3 (1988), p. 325-338 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1988-01-01
EUDML-ID : urn:eudml:doc:131054 
@article{GDZPPN000363766,
     title = {On the Complexity of Polyhedral Separability.},
     journal = {Discrete \& computational geometry},
     volume = {3},
     year = {1988},
     pages = {325-338},
     zbl = {0669.68035},
     url = {http://dml.mathdoc.fr/item/GDZPPN000363766}
}

Megiddo, N. On the Complexity of Polyhedral Separability.. Discrete & computational geometry, Tome 3 (1988) pp. 325-338. http://gdmltest.u-ga.fr/item/GDZPPN000363766/