Journal article

Complexity of semialgebraic proofs

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

Grigoriev, D., Hirsch, E., & Pasechnik, D. (2002). Complexity of semialgebraic proofs. Mosc. Math. J., 2(4), 647–679.

MLA Style

Grigoriev, D, et al. “Complexity of Semialgebraic Proofs.” Mosc. Math. J., vol. 2, no. 4, 2002, pp. 647–79.

Chicago Style

Grigoriev, D, E Hirsch, and D Pasechnik. 2002. “Complexity of Semialgebraic Proofs.” Mosc. Math. J. 2 (4): 647–79.
Print

Authors

+ Grigoriev, D More by this author

Role:: Author

+ Hirsch, E More by this author

Role:: Author

+ Pasechnik, D More by this author

Role:: Author

Journal:: Mosc. Math. J. More from this journal
Volume:: 2
Issue:: 4
Pages:: 647-679
Publication date:: 2002-01-01
ISSN:: 1609-3321

UUID:: uuid:1436f343-d629-461c-86f5-f55165f7bed9
Local pid:: cs:7282
Deposit date:: 2015-03-31
ARK identifier:: ark:/29072/ora_1436f343d629461c86f5f55165f7bed9

Terms of use

Copyright date:: 2002

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP