The following pages link to Cristopher Moore (Q162055):
Displaying 50 items.
- The Symmetric Group Defies Strong Fourier Sampling (Q3549325) (← links)
- (Q3549653) (← links)
- (Q3597147) (← links)
- (Q3624048) (← links)
- Generalized one-sided shifts and maps of the interval (Q3976847) (← links)
- (Q4224656) (← links)
- (Q4331195) (← links)
- (Q4336108) (← links)
- (Q4385615) (← links)
- (Q4407708) (← links)
- (Q4407712) (← links)
- On the 2-colorability of random hypergraphs (Q4440429) (← links)
- (Q4440436) (← links)
- (Q4449176) (← links)
- Unpredictability and undecidability in dynamical systems (Q4491788) (← links)
- Braids in classical dynamics (Q4492141) (← links)
- (Q4529537) (← links)
- Series expansion of the percolation threshold on hypercubic lattices (Q4629579) (← links)
- Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization (Q4682810) (← links)
- Oriented and degree-generated block models: generating and inferring communities with inhomogeneous degree distributions (Q4689340) (← links)
- (Q4737169) (← links)
- (Q4779171) (← links)
- (Q4814340) (← links)
- (Q4828960) (← links)
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness (Q4967226) (← links)
- Rapid mixing for lattice colourings with fewer colours (Q4968808) (← links)
- An Entropic Proof of Chang's Inequality (Q4979832) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283) (← links)
- The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5002631) (← links)
- Disordered systems insights on computational hardness (Q5055432) (← links)
- The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains (Q5146841) (← links)
- McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks (Q5199224) (← links)
- Generalized shifts: unpredictability and undecidability in dynamical systems (Q5201938) (← links)
- The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5232321) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313025) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313035) (← links)
- The rigidity transition in random graphs (Q5365113) (← links)
- (Q5414568) (← links)
- A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas (Q5433256) (← links)
- Counting connected graphs and hypergraphs via the probabilistic method (Q5433264) (← links)
- MAX <i>k</i>‐CUT and approximating the chromatic number of random graphs (Q5471049) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479388) (← links)
- Optimal $\varepsilon$-Biased Sets with Just a Little Randomness (Q5499738) (← links)
- (Q5501376) (← links)
- Theory and Applications of Satisfiability Testing (Q5714751) (← links)
- (Q5715725) (← links)
- Limitations of quantum coset states for graph isomorphism (Q5891930) (← links)
- Theory Is Forever (Q5894872) (← links)
- On the bias of traceroute sampling (Q5899511) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900333) (← links)
