Complexity transitions in global algorithms for sparse linear systems over finite fields

DOI10.1088/0305-4470/35/35/301zbMath1066.68053arXivcond-mat/0203613OpenAlexW2019156476WikidataQ61444456 ScholiaQ61444456MaRDI QIDQ4466077

Alfredo Braunstein, Riccardo Zecchina, Federico Ricci-Tersenghi, Michele Leone

Publication date: 9 June 2004

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0203613

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Equilibrium statistical mechanics (82B99)

Related Items (1)

Phase transitions in integer linear problems

This page was built for publication: Complexity transitions in global algorithms for sparse linear systems over finite fields