Pages that link to "Item:Q964729"
From MaRDI portal
The following pages link to Reductions in computational complexity using Clifford algebras (Q964729):
Displaying 12 items.
- Spinorial formulations of graph problems (Q430733) (← links)
- Complexity of counting cycles using zeons (Q660812) (← links)
- A new adjacency matrix for finite graphs (Q1038792) (← links)
- Clifford algebra as a bridge between discrete and continuous worlds (Q1668606) (← links)
- Clifford algebras meet tree decompositions (Q1725639) (← links)
- On the ternary approach to Clifford structures and Ising lattices (Q1929915) (← links)
- Support vector machine skin lesion classification in Clifford algebra subspaces. (Q2280460) (← links)
- Clifford algebra method for network expression, computation, and algorithm construction (Q5170222) (← links)
- Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras (Q5219709) (← links)
- Doubly efficient interactive proofs over infinite and non-commutative rings (Q6169369) (← links)
- Clifford algebra multivectors and kernels for melanoma classification (Q6180448) (← links)
- A generalization of Euler's formula in Clifford algebras (Q6180449) (← links)
