Abstract
An algorithm is given for constructing a cell decomposition of R**D, including adjacency information, defined by any given set of rational polynomials in d variables. The algorithm runs in single exponential parallel time, and in NC for fixed d. The algorithm extends a recent algorithm for deciding the theory of real closed fields.
| Original language | English (US) |
|---|---|
| Title of host publication | Annual Symposium on Foundations of Computer Science (Proceedings) |
| Publisher | IEEE |
| Pages | 515-521 |
| Number of pages | 7 |
| ISBN (Print) | 0818606444 |
| State | Published - 1985 |
Fingerprint
ASJC Scopus subject areas
- Hardware and Architecture
Cite this
ALGEBRAIC CELL DECOMPOSITION IN NC. / Kozen, Dexter; Yap, Chee.
Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1985. p. 515-521.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - ALGEBRAIC CELL DECOMPOSITION IN NC.
AU - Kozen, Dexter
AU - Yap, Chee
PY - 1985
Y1 - 1985
N2 - An algorithm is given for constructing a cell decomposition of R**D, including adjacency information, defined by any given set of rational polynomials in d variables. The algorithm runs in single exponential parallel time, and in NC for fixed d. The algorithm extends a recent algorithm for deciding the theory of real closed fields.
AB - An algorithm is given for constructing a cell decomposition of R**D, including adjacency information, defined by any given set of rational polynomials in d variables. The algorithm runs in single exponential parallel time, and in NC for fixed d. The algorithm extends a recent algorithm for deciding the theory of real closed fields.
UR - http://www.scopus.com/inward/record.url?scp=0022238420&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0022238420&partnerID=8YFLogxK
M3 - Conference contribution
SN - 0818606444
SP - 515
EP - 521
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - IEEE
ER -