The following pages link to Nathan Fox (Q388786):
Displaying 19 items.
- Abelian-primitive partial words (Q388787) (← links)
- Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation (Q1690783) (← links)
- On Hofstadter heart sequences (Q1694188) (← links)
- An exploration of solutions to two related Hofstadter-Huber recurrence relations (Q2122864) (← links)
- On the computational complexities of various geography variants (Q2127615) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- Quasipolynomial Solutions to the Hofstadter Q-Recurrence (Q2830431) (← links)
- (Q4691407) (← links)
- A Graph Polynomial Approach to Primitivity (Q4910454) (← links)
- Linear recurrent subsequences of generalized meta-Fibonacci sequences (Q4992000) (← links)
- A New Approach to the Hofstadter $Q$-Recurrence (Q5109416) (← links)
- A Slow Relative of Hofstadter's Q-Sequence (Q5278237) (← links)
- On the Asymptotic Abelian Complexity of Morphic Words (Q5300832) (← links)
- (Q5408177) (← links)
- An Aperiodic Subtraction Game of Nim-dimension Two (Q5502221) (← links)
- Connecting slow solutions to nested recurrences with linear recurrent sequences (Q5870247) (← links)
- Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model (Q6520151) (← links)
- Complexity and enumeration in models of genome rearrangement (Q6591453) (← links)
- Complexity and enumeration in models of genome rearrangement (Q6646439) (← links)
