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...
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 |
Ejemplares similares
-
Hamiltonian simulation algorithms for near-term quantum hardware
por: Clinton, Laura, et al.
Publicado: (2021) -
Uncomputability of phase diagrams
por: Bausch, Johannes, et al.
Publicado: (2021) -
Uncomputably complex renormalisation group flows
por: Watson, James D., et al.
Publicado: (2022) -
The Plasmodium LAP complex affects crystalloid biogenesis and oocyst cell division
por: Saeed, Sadia, et al.
Publicado: (2018) -
Divisibility patterns of natural numbers on a complex network
por: Shekatkar, Snehal M., et al.
Publicado: (2015)