The complexity of elementary algebra and geometry (preliminary version)

Michael Ben-Or; Dexter Kozen; John Reíf

doi:10.1145/800057.808712

The complexity of elementary algebra and geometry (preliminary version)

Michael Ben-Or, Dexter Kozen, John Reíf

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

26 Scopus citations

Original language	English
Title of host publication	Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC 1984
Publisher	Association for Computing Machinery
Pages	457-464
Number of pages	8
ISBN (Electronic)	0897911334
DOIs	https://doi.org/10.1145/800057.808712
State	Published - 1 Dec 1984
Externally published	Yes
Event	16th Annual ACM Symposium on Theory of Computing, STOC 1984 - Washington, United States Duration: 30 Apr 1984 → 2 May 1984

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
Volume	Part F130362
ISSN (Print)	0737-8017

Conference

Conference	16th Annual ACM Symposium on Theory of Computing, STOC 1984
Country/Territory	United States
City	Washington
Period	30/04/84 → 2/05/84

Access to Document

10.1145/800057.808712

Cite this

Ben-Or, M., Kozen, D., & Reíf, J. (1984). The complexity of elementary algebra and geometry (preliminary version). In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC 1984 (pp. 457-464). (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F130362). Association for Computing Machinery. https://doi.org/10.1145/800057.808712

@inproceedings{5783f1b3e92f492980cb9713f95d1261,

title = "The complexity of elementary algebra and geometry (preliminary version)",

author = "Michael Ben-Or and Dexter Kozen and John Re{\'i}f",

year = "1984",

month = dec,

day = "1",

doi = "10.1145/800057.808712",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "457--464",

booktitle = "Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC 1984",

note = "16th Annual ACM Symposium on Theory of Computing, STOC 1984 ; Conference date: 30-04-1984 Through 02-05-1984",

}

Ben-Or, M, Kozen, D & Reíf, J 1984, The complexity of elementary algebra and geometry (preliminary version). in Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC 1984. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F130362, Association for Computing Machinery, pp. 457-464, 16th Annual ACM Symposium on Theory of Computing, STOC 1984, Washington, United States, 30/04/84. https://doi.org/10.1145/800057.808712

The complexity of elementary algebra and geometry (preliminary version). / Ben-Or, Michael; Kozen, Dexter; Reíf, John.
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC 1984. Association for Computing Machinery, 1984. p. 457-464 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F130362).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The complexity of elementary algebra and geometry (preliminary version)

AU - Ben-Or, Michael

AU - Kozen, Dexter

AU - Reíf, John

PY - 1984/12/1

Y1 - 1984/12/1

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

U2 - 10.1145/800057.808712

DO - 10.1145/800057.808712

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85036457312

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 457

EP - 464

BT - Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC 1984

PB - Association for Computing Machinery

T2 - 16th Annual ACM Symposium on Theory of Computing, STOC 1984

Y2 - 30 April 1984 through 2 May 1984

ER -

The complexity of elementary algebra and geometry (preliminary version)

Publication series

Conference

Access to Document

Other files and links

Cite this