Complexity of Stratifications of Semi-Pfaffian Sets.
Discrete & computational geometry (1995)
- Volume: 14, Issue: 1, page 71-92
- ISSN: 0179-5376; 1432-0444/e
Access Full Article
top
How to cite
topGabrielov, A., and Vorobjov, N.. "Complexity of Stratifications of Semi-Pfaffian Sets.." Discrete & computational geometry 14.1 (1995): 71-92. <http://eudml.org/doc/131392>.
@article{Gabrielov1995,
author = {Gabrielov, A., Vorobjov, N.},
journal = {Discrete & computational geometry},
keywords = {semi-Pfaffian set; sparse polynomials; exponential polynomials},
number = {1},
pages = {71-92},
title = {Complexity of Stratifications of Semi-Pfaffian Sets.},
url = {http://eudml.org/doc/131392},
volume = {14},
year = {1995},
}
TY - JOUR
AU - Gabrielov, A.
AU - Vorobjov, N.
TI - Complexity of Stratifications of Semi-Pfaffian Sets.
JO - Discrete & computational geometry
PY - 1995
VL - 14
IS - 1
SP - 71
EP - 92
KW - semi-Pfaffian set; sparse polynomials; exponential polynomials
UR - http://eudml.org/doc/131392
ER -
NotesEmbed ?
topYou 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.