Journal article

Computing the Least Fixed Point of Positive Polynomial Systems

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.
Cite

Cite this record

APA Style

Esparza, J., Kiefer, S., & Luttenberger, M. (2010). Computing the Least Fixed Point of Positive Polynomial Systems. SIAM Journal on Computing, 39(6), 2282–2335.

MLA Style

Esparza, J., et al. “ Computing the Least Fixed Point of Positive Polynomial Systems.” SIAM Journal on Computing, vol. 39, no. 6, 2010, pp. 2282–335.

Chicago Style

Esparza, J, S Kiefer, and M Luttenberger. 2010. “ Computing the Least Fixed Point of Positive Polynomial Systems.” SIAM Journal on Computing 39 (6): 2282–2335.
Share
Print

Access Document

Publisher copy:: 10.1137/090749591

Authors

+ Esparza, J More by this author

Role:: Author

+ Kiefer, S More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Computer Science
Role:: Author

+ Luttenberger, M More by this author

Role:: Author

Journal:: SIAM Journal on Computing More from this journal
Volume:: 39
Issue:: 6
Pages:: 2282-2335
Publication date:: 2010-01-01
DOI:: 10.1137/090749591
EISSN:: 1095-7111
ISSN:: 0097-5397

Pubs id:: pubs:433229
UUID:: uuid:51deed2e-04c9-43f2-b780-e5bc3bf2b579
Local pid:: pubs:433229
Source identifiers:: 433229
Deposit date:: 2013-11-16

Terms of use

Copyright date:: 2010

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