On the hardness of finding normal surfaces (Q2063199): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: 3-manifold knot genus is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational topology with Regina: Algorithms, heuristics and implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to crushing 3-manifold triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of knot and link problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of basic decision problems in 3-dimensional topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to decide if a 3-manifold is a Haken manifold / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-efficient triangulations of 3-manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the complete decomposition of a closed \(3\)-manifold / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-sided Heegaard splittings of 3-manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3105314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer homology 3-spheres admit irreducible representations in \(\mathrm{SL}(2,{\mathbb C})\) / rank
 
Normal rank

Latest revision as of 16:16, 27 July 2024

scientific article
Language Label Description Also known as
English
On the hardness of finding normal surfaces
scientific article

    Statements

    On the hardness of finding normal surfaces (English)
    0 references
    0 references
    0 references
    10 January 2022
    0 references
    computational topology
    0 references
    3-manifolds
    0 references
    normal surfaces
    0 references
    computational complexity
    0 references

    Identifiers