Geometric Optimization and Dp-Completeness.

C. Bajaj; Ming Li

Discrete & computational geometry (1989)

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

How to cite

top

Bajaj, C., and Li, Ming. "Geometric Optimization and Dp-Completeness.." Discrete & computational geometry 4.1 (1989): 3-14. <http://eudml.org/doc/131060>.

@article{Bajaj1989,
author = {Bajaj, C., Li, Ming},
journal = {Discrete & computational geometry},
keywords = {-completeness; complexity of optimization problems; polynomial hierarchy; geometric optimization},
number = {1},
pages = {3-14},
title = {Geometric Optimization and Dp-Completeness.},
url = {http://eudml.org/doc/131060},
volume = {4},
year = {1989},
}

TY - JOUR
AU - Bajaj, C.
AU - Li, Ming
TI - Geometric Optimization and Dp-Completeness.
JO - Discrete & computational geometry
PY - 1989
VL - 4
IS - 1
SP - 3
EP - 14
KW - -completeness; complexity of optimization problems; polynomial hierarchy; geometric optimization
UR - http://eudml.org/doc/131060
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.