The following pages link to George Stacey Staples (Q1038791):
Displaying 23 items.
- (Q605303) (redirect page) (← links)
- Dynamic geometric graph processes: Adjacency operator approach (Q605304) (← links)
- Connected components and evolution of random graphs: An algebraic approach (Q658541) (← links)
- Complexity of counting cycles using zeons (Q660812) (← links)
- Partitions and Clifford algebras (Q925015) (← links)
- Reductions in computational complexity using Clifford algebras (Q964729) (← links)
- A new adjacency matrix for finite graphs (Q1038792) (← links)
- Generalized zeon algebras: theory and application to multi-constrained path problems (Q2361017) (← links)
- Graph-theoretic approach to stochastic integrals with Clifford algebras (Q2641426) (← links)
- (Q2790536) (← links)
- OPERATOR CALCULUS AND INVERTIBLE CLIFFORD APPELL SYSTEMS: THEORY AND APPLICATION TO THE n-PARTICLE FERMION ALGEBRA (Q2854015) (← links)
- (Q2881260) (← links)
- (Q2960887) (← links)
- Computational Complexity Reductions Using Clifford Algebras (Q3060697) (← links)
- Operator Homology and Cohomology in Clifford Algebras (Q3061840) (← links)
- (Q3098637) (← links)
- (Q3400673) (← links)
- Dynamic random walks in Clifford algebras (Q3564956) (← links)
- (Q3606278) (← links)
- On the Complexity of Cycle Enumeration for Simple Graphs (Q4979428) (← links)
- Clifford Algebras and Zeons (Q5233488) (← links)
- (Q5440617) (← links)
- Nilpotent adjacency matrices, random graphs and quantum random variables (Q5460453) (← links)
