Geodesic
Geometric Optimization and Dp-Completeness.
Discrete & computational geometry, Tome 4 (1989) no. 6, pp. 3-14 Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : -completeness, complexity of optimization problems, polynomial hierarchy, geometric optimization 
@article{DCG_1989__4_6_131060,
     author = {C. Bajaj and Ming Li},
     title = {Geometric {Optimization} and {Dp-Completeness.}},
     journal = {Discrete & computational geometry},
     pages = {3--14},
     year = {1989},
     volume = {4},
     number = {6},
     zbl = {0651.68055},
     url = {http://geodesic.mathdoc.fr/item/DCG_1989__4_6_131060/}
}
TY  - JOUR
AU  - C. Bajaj
AU  - Ming Li
TI  - Geometric Optimization and Dp-Completeness.
JO  - Discrete & computational geometry
PY  - 1989
SP  - 3
EP  - 14
VL  - 4
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/DCG_1989__4_6_131060/
ID  - DCG_1989__4_6_131060
ER  - 
%0 Journal Article
%A C. Bajaj
%A Ming Li
%T Geometric Optimization and Dp-Completeness.
%J Discrete & computational geometry
%D 1989
%P 3-14
%V 4
%N 6
%U http://geodesic.mathdoc.fr/item/DCG_1989__4_6_131060/
%F DCG_1989__4_6_131060
C. Bajaj; Ming Li. Geometric Optimization and Dp-Completeness.. Discrete & computational geometry, Tome 4 (1989) no. 6, pp. 3-14. http://geodesic.mathdoc.fr/item/DCG_1989__4_6_131060/