The following pages link to Tensor Geometry (Q4002166):
Displaying 36 items.
- Linearisation of tautological control systems (Q254846) (← links)
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- Absolute objects and counterexamples: Jones-geroch dust, torretti constant curvature, tetrad-spinor, and scalar density (Q643051) (← links)
- Signature theory in holographic algorithms (Q652529) (← links)
- Semi-metrics, closure spaces and digital topology (Q671997) (← links)
- Multilinear methods in linear algebra (Q755852) (← links)
- Clique graphs and Helly graphs (Q802632) (← links)
- A model for Gaussian perturbations of graphene (Q904375) (← links)
- Holographic algorithms: the power of dimensionality resolved (Q1014633) (← links)
- A fixed cube theorem for median graphs (Q1092929) (← links)
- Invariant Hamming graphs in infinite quasi-median graphs (Q1126287) (← links)
- A new generalisation of graph theory (Q1170269) (← links)
- Algorithms for the fixed point property (Q1285782) (← links)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- Geometry of the Welch bounds (Q1758450) (← links)
- Tensors, differential geometry and statistical shading analysis (Q1799554) (← links)
- Monopole charge quantization or why electromagnetism is a \(U\)(1)-gauge theory (Q1877778) (← links)
- Holographic algorithms by Fibonacci gates (Q1931762) (← links)
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
- The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
- FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
- Valiant's holant theorem and matchgate tensors (Q2382280) (← links)
- Components of the fundamental category. II (Q2463396) (← links)
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
- Why Shading Matters along Contours (Q2950721) (← links)
- (Q3574424) (← links)
- Yet another introduction to rough paths (Q3653073) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- (Q5239689) (← links)
- Classification of a Class of Counting Problems Using Holographic Reductions (Q5323095) (← links)
- (Q5389899) (← links)
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
- Welch bounds for cross correlation of subspaces and generalizations (Q5741221) (← links)
- Tensors in computations (Q5887832) (← links)
- The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)
