## The complexity of elementary algebra and geometry (preliminary version)

Publication
, Conference

Ben-Or, M; Kozen, D; Reíf, J

Published in: Proceedings of the Annual ACM Symposium on Theory of Computing

December 1, 1984

### Duke Scholars

## Published In

Proceedings of the Annual ACM Symposium on Theory of Computing

## DOI

## ISSN

0737-8017

## Publication Date

December 1, 1984

## Volume

Part F130362

## Start / End Page

457 / 464

### Citation

APA

Chicago

ICMJE

MLA

NLM

Ben-Or, M., Kozen, D., & Reíf, J. (1984). The complexity of elementary algebra and geometry (preliminary version). In

*Proceedings of the Annual ACM Symposium on Theory of Computing*(Vol. Part F130362, pp. 457–464). https://doi.org/10.1145/800057.808712Ben-Or, M., D. Kozen, and J. Reíf. “The complexity of elementary algebra and geometry (preliminary version).” In

*Proceedings of the Annual ACM Symposium on Theory of Computing*, Part F130362:457–64, 1984. https://doi.org/10.1145/800057.808712.Ben-Or M, Kozen D, Reíf J. The complexity of elementary algebra and geometry (preliminary version). In: Proceedings of the Annual ACM Symposium on Theory of Computing. 1984. p. 457–64.

Ben-Or, M., et al. “The complexity of elementary algebra and geometry (preliminary version).”

*Proceedings of the Annual ACM Symposium on Theory of Computing*, vol. Part F130362, 1984, pp. 457–64.*Scopus*, doi:10.1145/800057.808712.Ben-Or M, Kozen D, Reíf J. The complexity of elementary algebra and geometry (preliminary version). Proceedings of the Annual ACM Symposium on Theory of Computing. 1984. p. 457–464.

## Published In

Proceedings of the Annual ACM Symposium on Theory of Computing

## DOI

## ISSN

0737-8017

## Publication Date

December 1, 1984

## Volume

Part F130362

## Start / End Page

457 / 464