The following pages link to Moore, Cristopher (Q162055):
Displaying 50 items.
- (Q228680) (redirect page) (← links)
- (Q329449) (redirect page) (← links)
- The phase transition in random regular exact cover (Q329450) (← links)
- (Q585940) (redirect page) (← links)
- Quasilinear cellular automata (Q992263) (← links)
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines (Q1274815) (← links)
- Complexity of two-dimensional patterns (Q1284933) (← links)
- Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness (Q1285169) (← links)
- The computational complexity of sandpiles (Q1308079) (← links)
- Recursion theory on the reals and continuous-time computation (Q1349921) (← links)
- Predicting nonlinear cellular automata quickly by decomposing them into linear ones (Q1376426) (← links)
- Quantum automata and quantum grammars (Q1566730) (← links)
- Circuits and expressions with nonassociative gates (Q1567406) (← links)
- Internal diffusion-limited aggregation: parallel algorithms and complexity (Q1581686) (← links)
- Height representation, critical exponents, and ergodicity in the four-state triangular Potts antiferromagnet (Q1581700) (← links)
- Ribbon tile invariants from the signed area (Q1601417) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- Queues, stacks, and transcendentality at the transition to chaos (Q1961669) (← links)
- The planted matching problem: phase transitions and exact results (Q2075325) (← links)
- A computational approach to animal breeding (Q2209102) (← links)
- On the computational power of probabilistic and quantum branching program (Q2581534) (← links)
- (Q2707531) (← links)
- (Q2762794) (← links)
- (Q2768371) (← links)
- Parallel Quantum Computation and Quantum Codes (Q2784481) (← links)
- Small-Bias Sets for Nonabelian Groups (Q2851876) (← links)
- The Power of Choice for Random Satisfiability (Q2851879) (← links)
- Approximating the Permanent via Nonabelian Determinants (Q2903520) (← links)
- Quantum algorithms for Simon's problem over nonabelian groups (Q2930295) (← links)
- (Q2934717) (← links)
- Generic quantum Fourier transforms (Q2944537) (← links)
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem (Q2953697) (← links)
- Spectral redemption in clustering sparse networks (Q2962184) (← links)
- Tree codes and a conjecture on exponential sums (Q2988874) (← links)
- Computational complexity, phase transitions, and message-passing for community detection (Q2990197) (← links)
- On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism (Q3068637) (← links)
- Independent Sets in Random Graphs from the Weighted Second Moment Method (Q3088119) (← links)
- (Q3090774) (← links)
- A Graph Integral Formulation of the Circuit Partition Polynomial (Q3103635) (← links)
- Tight Bounds on the Threshold for Permuted k-Colorability (Q3167422) (← links)
- Finding conjugate stabilizer subgroups in PSL(2; q) and related groups (Q3172434) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
- The complexity of the fermionant, and immanants of constant width (Q3191574) (← links)
- Random <i>k</i>‐SAT: Two Moments Suffice to Cross a Sharp Threshold (Q3446816) (← links)
- Group representations that resist random sampling (Q3452732) (← links)
- Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups (Q3453573) (← links)
- The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts (Q3507527) (← links)
- (Q3522655) (← links)
- (Q3549254) (← links)
