The complexity of quantifier elimination and cylindrical algebraic decomposition

Christopher W Brown, James H Davenport

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

58 Citations (Scopus)
Original languageEnglish
Title of host publicationISSAC '07 Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Place of PublicationNew York
PublisherAssociation for Computing Machinery
Pages54-60
Number of pages7
ISBN (Print)9781595937438
DOIs
Publication statusPublished - 2007
EventProceedings of the 2007 international symposium on Symbolic and algebraic computation - Waterloo, Ontario, Canada
Duration: 1 Jan 2007 → …

Conference

ConferenceProceedings of the 2007 international symposium on Symbolic and algebraic computation
CountryCanada
CityWaterloo, Ontario
Period1/01/07 → …

Cite this

Brown, C. W., & Davenport, J. H. (2007). The complexity of quantifier elimination and cylindrical algebraic decomposition. In ISSAC '07 Proceedings of the 2007 international symposium on Symbolic and algebraic computation (pp. 54-60). New York: Association for Computing Machinery. https://doi.org/10.1145/1277548.1277557

The complexity of quantifier elimination and cylindrical algebraic decomposition. / Brown, Christopher W; Davenport, James H.

ISSAC '07 Proceedings of the 2007 international symposium on Symbolic and algebraic computation . New York : Association for Computing Machinery, 2007. p. 54-60.

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

Brown, CW & Davenport, JH 2007, The complexity of quantifier elimination and cylindrical algebraic decomposition. in ISSAC '07 Proceedings of the 2007 international symposium on Symbolic and algebraic computation . Association for Computing Machinery, New York, pp. 54-60, Proceedings of the 2007 international symposium on Symbolic and algebraic computation, Waterloo, Ontario, Canada, 1/01/07. https://doi.org/10.1145/1277548.1277557
Brown CW, Davenport JH. The complexity of quantifier elimination and cylindrical algebraic decomposition. In ISSAC '07 Proceedings of the 2007 international symposium on Symbolic and algebraic computation . New York: Association for Computing Machinery. 2007. p. 54-60 https://doi.org/10.1145/1277548.1277557
Brown, Christopher W ; Davenport, James H. / The complexity of quantifier elimination and cylindrical algebraic decomposition. ISSAC '07 Proceedings of the 2007 international symposium on Symbolic and algebraic computation . New York : Association for Computing Machinery, 2007. pp. 54-60
@inproceedings{de071eb199f84021950c13ffc5681b4a,
title = "The complexity of quantifier elimination and cylindrical algebraic decomposition",
author = "Brown, {Christopher W} and Davenport, {James H}",
year = "2007",
doi = "10.1145/1277548.1277557",
language = "English",
isbn = "9781595937438",
pages = "54--60",
booktitle = "ISSAC '07 Proceedings of the 2007 international symposium on Symbolic and algebraic computation",
publisher = "Association for Computing Machinery",
address = "USA United States",

}

TY - GEN

T1 - The complexity of quantifier elimination and cylindrical algebraic decomposition

AU - Brown, Christopher W

AU - Davenport, James H

PY - 2007

Y1 - 2007

UR - http://dx.doi.org/10.1145/1277548.1277557

U2 - 10.1145/1277548.1277557

DO - 10.1145/1277548.1277557

M3 - Conference contribution

SN - 9781595937438

SP - 54

EP - 60

BT - ISSAC '07 Proceedings of the 2007 international symposium on Symbolic and algebraic computation

PB - Association for Computing Machinery

CY - New York

ER -