Cargando…

The complexity of divisibility

We address two sets of long-standing open questions in linear algebra and probability theory, from a computational complexity perspective: stochastic matrix divisibility, and divisibility and decomposability of probability distributions. We prove that finite divisibility of stochastic matrices is an...

Descripción completa

Detalles Bibliográficos
Autores principales: Bausch, Johannes, Cubitt, Toby
Formato: Online Artículo Texto
Lenguaje:English
Publicado: North Holland [etc.] 2016
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5465997/
https://www.ncbi.nlm.nih.gov/pubmed/28626246
http://dx.doi.org/10.1016/j.laa.2016.03.041