ALGEBRAIC CELL DECOMPOSITION IN NC.

Dexter Kozen, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages515-521
Number of pages7
ISBN (Print)0818606444
StatePublished - 1985

Fingerprint

Decomposition
Polynomials

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Kozen, D., & Yap, C. (1985). ALGEBRAIC CELL DECOMPOSITION IN NC. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 515-521). IEEE.

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 proceedingConference contribution

Kozen, D & Yap, C 1985, ALGEBRAIC CELL DECOMPOSITION IN NC. in Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, pp. 515-521.
Kozen D, Yap C. ALGEBRAIC CELL DECOMPOSITION IN NC. In Annual Symposium on Foundations of Computer Science (Proceedings). IEEE. 1985. p. 515-521
Kozen, Dexter ; Yap, Chee. / ALGEBRAIC CELL DECOMPOSITION IN NC. Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1985. pp. 515-521
@inproceedings{25b56bc2984a4688af4634577309d621,
title = "ALGEBRAIC CELL DECOMPOSITION IN NC.",
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.",
author = "Dexter Kozen and Chee Yap",
year = "1985",
language = "English (US)",
isbn = "0818606444",
pages = "515--521",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "IEEE",

}

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 -