Complexity classes as mathematical axioms II
| Autor: | Michael H. Freedman, Zhenghan Wang, Shawn X. Cui |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
FOS: Computer and information sciences
Link diagram 57M25 68Q15 81P68 010102 general mathematics Jones polynomial Geometric Topology (math.GT) Computational Complexity (cs.CC) 01 natural sciences Algebra Computer Science - Computational Complexity Mathematics - Geometric Topology 010104 statistics & probability ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION FOS: Mathematics Complexity class Geometry and Topology 0101 mathematics Mathematical Physics Axiom Mathematics |
| Zdroj: | Quantum Topology. 7:185-201 |
| ISSN: | 1663-487X |
| DOI: | 10.4171/qt/75 |
| Popis: | The second author previously discussed how classical complexity separation conjectures, we call them "axioms", have implications in three manifold topology: polynomial length stings of operations which preserve certain Jones polynomial evaluations cannot produce exponential simplifications of link diagrams. In this paper, we continue this theme, exploring now more subtle separation axioms for quantum complexity classes. Surprisingly, we now find that similar strings are unable to effect even linear simplifications of the diagrams. Comment: To appear in Quantum Topology |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|