English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Subtraction-free complexity, cluster transformations, and spanning trees

MPS-Authors
/persons/resource/persons235255

Fomin,  Sergey
Max Planck Institute for Mathematics, Max Planck Society;

/persons/resource/persons235358

Grigoriev,  Dima
Max Planck Institute for Mathematics, Max Planck Society;

/persons/resource/persons235610

Koshevoy,  Gleb
Max Planck Institute for Mathematics, Max Planck Society;

External Resource

http://dx.doi.org/10.1007/s10208-014-9231-y
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
Supplementary Material (public)
There is no public supplementary material available
Citation

Fomin, S., Grigoriev, D., & Koshevoy, G. (2016). Subtraction-free complexity, cluster transformations, and spanning trees. Foundations of Computational Mathematics. the Journal of the Society for the Foundations of Computational Mathematics, 16(1), 1-31. doi:10.1007/s10208-014-9231-y.


Cite as: https://hdl.handle.net/21.11116/0000-0004-0CF9-7
Abstract
There is no abstract available