Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Moore, Cris - Department of Computer Science, University of New Mexico
THE EVOLUTION OF MULAN: SOME STUDIES IN GAME-TREE PRUNING AND
Applications of the Probabilistic Method to Random Graphs
Nonlinearity 4 (1991) 199-230. Printed in the UK Generalized shifts: unpredictability and undecidability in
Approximate Representations and Approximate Homomorphisms
Predicting Lattice Gases is P-complete Cristopher Moore1 and Mats G. Nordahl2
Continuous Methods in Computer Science: from Random Graph Coloring
The physical limits of communication Why any sufficiently advanced technology is indistinguishable
A Compilation of Results on Phase Transitions, Scale-Invariance
Approximating the Permanent via
Lecture notes on finite-state automata and regular languages Cristopher Moore
The McEliece Cryptosystem Resists Quantum Fourier Sampling Attack
Second Moment Lower Bounds
The Power of Choice in Social Networks
CS500 Homework Zero Prof. Cris Moore
Phase transitions in NP-complete problems: a challenge for probability, combinatorics, and
Hierarchical Structure and Predicting Missing Links
A Tale of Two Cultures: Phase Transitions in
Fearful Symmetries: Factoring, Graph Isomorphism,
DRAFT --DRAFT --DRAFT --DRAFT --DRAFT --Mathematical Tools
Recursion Theory on the Reals and Continuous-time Computation
Sending Secrets: Cryptography in a Quantum World
CS500 Homework Zero Prof. Cris Moore
RandomVectors, Random Matrices, and
Lecture notes on automata, languages, and grammars Cristopher Moore
Quantum computers elicit dreams of great computational feats to come. But they also promise a nightmare: They could break
Message-Passing Algorithms for Network Analysis Cristopher Moore (UNM / Santa Fe Institute)
Let the Physics Do the Work: Scattering Algorithms for High-Dimensional