Pokart, T., Pollmann, F., & Budich, J. C. (2026). Entanglement Barriers from Computational Complexity: Matrix-Product-State Approach to Satisfiability.
Citazione stile Chigago Style (17a edizione)Pokart, Tim, Frank Pollmann, e Jan Carl Budich. Entanglement Barriers from Computational Complexity: Matrix-Product-State Approach to Satisfiability. 2026.
Citatione MLA (9a ed.)Pokart, Tim, et al. Entanglement Barriers from Computational Complexity: Matrix-Product-State Approach to Satisfiability. 2026.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.