Polynomial complexity despite the fermionic sign¶

R Rossi, N. P., Svistunov, B., Houcke, K. V., & Werner, F. (2017). Polynomial complexity despite the fermionic sign.

Type: Unclassified
Intellectual base: Unclassified
Year: 2017
DOI: 10.1209/0295-5075/118/10004
Link: https://doi.org/10.1209/0295-5075/118/10004

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Diagrammatic Monte Carlo
- … diagrammatic expansion and order, configuration space, weights and signs, proposal moves, normalization, estimators, convergence and resummation checks and statistical errors are explicit. to An applied instance preserves the invariant under changed notation, scale, dataset, jurisdiction, or implementation..

Verification¶

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:64e2d6994770 · see in the full table