EUVIMEDObjevte EUVIMED
Crossref

Dvoretzky's theorem and the complexity of entanglement detection

Stanislaw Szarek, Guillaume Aubrun

Discrete Analysis · 2017

DOI: 10.19086/da.1242 ↗

At a glance

Journal article in Discrete Analysis, 2017. Written by Stanislaw Szarek and 1 co-authors. Cited 4 times so far (Crossref).

AbstraktBibliografické údajeCiteRelated studies

Abstract (original language)

Není k dispozici žádný abstrakt.

Cite

APA

Szarek, S., & Aubrun, G. (2017). Dvoretzky's theorem and the complexity of entanglement detection. Discrete Analysis. https://doi.org/10.19086/da.1242

Vancouver

Szarek S, Aubrun G. Dvoretzky's theorem and the complexity of entanglement detection. Discrete Analysis. 2017. doi:10.19086/da.1242

BibTeX
@article{Szarek2017,
  author = {Szarek, Stanislaw and Aubrun, Guillaume},
  title = {Dvoretzky's theorem and the complexity of entanglement detection},
  journal = {Discrete Analysis},
  year = {2017},
  doi = {10.19086/da.1242}
}
Start for free →