On the Complexity of Polyhedral Separability.

N. Megiddo

Discrete & computational geometry (1988)

  • Volume: 3, Issue: 4, page 325-338
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Megiddo, N.. "On the Complexity of Polyhedral Separability.." Discrete & computational geometry 3.4 (1988): 325-338. <http://eudml.org/doc/131054>.

@article{Megiddo1988,
author = {Megiddo, N.},
journal = {Discrete & computational geometry},
keywords = {complexity; polyhedral separability; computational geometry; linear separability problem},
number = {4},
pages = {325-338},
title = {On the Complexity of Polyhedral Separability.},
url = {http://eudml.org/doc/131054},
volume = {3},
year = {1988},
}

TY - JOUR
AU - Megiddo, N.
TI - On the Complexity of Polyhedral Separability.
JO - Discrete & computational geometry
PY - 1988
VL - 3
IS - 4
SP - 325
EP - 338
KW - complexity; polyhedral separability; computational geometry; linear separability problem
UR - http://eudml.org/doc/131054
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.