The following pages link to (Q2941639):
Displaying 23 items.
- Complexity classes as mathematical axioms. II (Q259630) (← links)
- The complexity of estimating min-entropy (Q260395) (← links)
- Denseness and Zariski denseness of Jones braid representations. (Q625328) (← links)
- A permanent formula for the Jones polynomial (Q719783) (← links)
- Models of random knots (Q1659256) (← links)
- The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832) (← links)
- Identifying lens spaces in polynomial time (Q1743503) (← links)
- Computational complexity and 3-manifolds and zombies (Q1785090) (← links)
- Inapproximability of the Tutte polynomial of a planar graph (Q1926110) (← links)
- Coloring invariants of knots and links are often intractable (Q1983547) (← links)
- The complexity of approximating the complex-valued Potts model (Q2125077) (← links)
- Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups (Q2258015) (← links)
- Circuit complexity of knot states in Chern-Simons theory (Q2317813) (← links)
- On metaplectic modular categories and their applications (Q2509618) (← links)
- Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (Q2954372) (← links)
- Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ (Q2969880) (← links)
- The complexity of approximating the complex-valued Potts model (Q5089203) (← links)
- (Q5092454) (← links)
- (Q5121907) (← links)
- (Q5121909) (← links)
- (Q5889073) (← links)
- Topological quantum computation is hyperbolic (Q6109364) (← links)
- (Q6176153) (← links)
