36 citations · 170 across the 13 of their papers we have counts for
Showing 2003Show all
3 papers · 1 filter
cond-mat2003★ 36 cited
How Do Networks Become Navigable?
Aaron Clauset, Cristopher Moore
Networks created and maintained by social processes, such as the human friendship network and the World Wide Web, appear to exhibit the property of navigability: namely, not only d…
cond-mat.stat-mech2003★ 6 cited
Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold
Dimitris Achlioptas, Cristopher Moore
Many NP-complete constraint satisfaction problems appear to undergo a "phase transition'' from solubility to insolubility when the constraint density passes through a critical thre…
quant-ph2003★ 6 cited
Generic Quantum Fourier Transforms
Cristopher Moore, Daniel Rockmore, Alexander Russell
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient…