NarrowHighway

A card from a free library — ask anything, no account, works offline. Every card carries its source.

M. Troyer 2005 — Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations

source

M. Troyer, U.-J. Wiese (2005). Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations. Phys. Rev. Lett. 94 (2005) 170201. DOI 10.1103/PhysRevLett.94.170201. arXiv: cond-mat/0408370. Canonical: https://doi.org/10.1103/PhysRevLett.94.170201. Free copy: https://arxiv.org/abs/cond-mat/0408370. License as found: APS default license (link.aps.org/licenses/aps-default-license) — publisher's copyright, cited. Serves the joints between the problems on the one map (card_floor_millennium): the sign-problem joint: the lattice sign problem is NP-hard (Yang-Mills ↔ P vs NP).

source
M. Troyer, U.-J. Wiese (2005), Phys. Rev. Lett. 94 (2005) 170201 ↗
card id
card_src_mill_troyer_wiese_2005
address
SCI.millennium.FCT/computational-complexity-and-fundamental-limitat/REF.WITNESSED@m-troyer-u-j-wiese

related in the keeping ↗ · raw JSON ↗

adjoining cards

Is this card incomplete? Tell the library — it will call out for more ↗