The complexity of elementary algebra and geometry

Michael Ben-Or; Dexter Kozen; John Reif

doi:10.1016/0022-0000(86)90029-2

The complexity of elementary algebra and geometry

Michael Ben-Or^*, Dexter Kozen, John Reif

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

129 Scopus citations

Abstract

The theory of real closed fields can be decided in exponential space or parallel exponential time. In fixed dimension, the theory can be decided in NC.

Original language	English
Pages (from-to)	251-264
Number of pages	14
Journal	Journal of Computer and System Sciences
Volume	32
Issue number	2
DOIs	https://doi.org/10.1016/0022-0000(86)90029-2
State	Published - Apr 1986

Access to Document

10.1016/0022-0000(86)90029-2

Cite this

@article{ca6b85b1ff7f45d6947b05ace5cd99da,

title = "The complexity of elementary algebra and geometry",

abstract = "The theory of real closed fields can be decided in exponential space or parallel exponential time. In fixed dimension, the theory can be decided in NC.",

author = "Michael Ben-Or and Dexter Kozen and John Reif",

year = "1986",

month = apr,

doi = "10.1016/0022-0000(86)90029-2",

language = "אנגלית",

volume = "32",

pages = "251--264",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - The complexity of elementary algebra and geometry

AU - Ben-Or, Michael

AU - Kozen, Dexter

AU - Reif, John

PY - 1986/4

Y1 - 1986/4

N2 - The theory of real closed fields can be decided in exponential space or parallel exponential time. In fixed dimension, the theory can be decided in NC.

AB - The theory of real closed fields can be decided in exponential space or parallel exponential time. In fixed dimension, the theory can be decided in NC.

UR - http://www.scopus.com/inward/record.url?scp=0022706013&partnerID=8YFLogxK

U2 - 10.1016/0022-0000(86)90029-2

DO - 10.1016/0022-0000(86)90029-2

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0022706013

SN - 0022-0000

VL - 32

SP - 251

EP - 264

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 2

ER -

The complexity of elementary algebra and geometry

Abstract

Access to Document

Other files and links

Fingerprint

Cite this