Complexity classes as mathematical axioms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3137995 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- A spanning tree expansion of the Jones polynomial
- Finite functions and the necessary use of large cardinals
- Fox's congruence classes and the quantum-\(SU(2)\) invariants of links in 3-manifolds
- Invariants of 3-manifolds via link polynomials and quantum groups
- Non‐recursive functions, knots “with thick ropes,” and self‐clenching “thick” hyperspheres
- On the computational complexity of the Jones and Tutte polynomials
- Quantum invariants of knots and 3-manifolds
- The Computational Complexity of Tutte Invariants for Planar Graphs
- The undecidability of the domino problem
- The word problem and the isomorphism problem for groups
- Topological quantum computation
Cited in
(12)- Dimension Characterizations of Complexity Classes
- Complexity classes as mathematical axioms. II
- Computational Number Theory and Cryptography
- A polynomial-time algorithm to compute Turaev-Viro invariants \(\mathrm{TV}_{4,q}\) of 3-manifolds with bounded first Betti number
- Incompleteness in the finite domain
- Hard-core theorems for complexity classes
- On the metamathematics of the P vs. NP question
- \(\mathfrak{sl}_3\)-foam homology calculations
- Mathematics of topological quantum computing
- Topological quantum computation is hyperbolic
- Is there a simple, pedestrian arithmetic sentence which is independent of ZFC?
- Truth vs. proof in computational complexity
This page was built for publication: Complexity classes as mathematical axioms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731212)
