The computational complexity of basic decision problems in 3-dimensional topology (Q2481645): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q841095
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sergei V. Ivanov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10711-007-9210-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992600635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of knot genus and spanning area / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative proof that 3-manifolds can be triangulated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foliations and the topology of 3-manifolds. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knots are Determined by Their Complements / 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: Q5288300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing the 3-sphere / 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: PL equivariant surgery and invariant decompositions of 3-manifolds / 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: An algorithm for the recognition of 3-spheres (according to Thompson) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine structures in 3-manifolds. V: The triangulation theorem and Hauptvermutung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4866009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3105314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost normal surfaces in 3-manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thin position and the recognition problem for \(S^ 3\) / rank
 
Normal rank

Latest revision as of 20:17, 27 June 2024

scientific article
Language Label Description Also known as
English
The computational complexity of basic decision problems in 3-dimensional topology
scientific article

    Statements

    The computational complexity of basic decision problems in 3-dimensional topology (English)
    0 references
    14 April 2008
    0 references
    3-manifolds
    0 references
    Triangulations
    0 references
    Normal surfaces
    0 references
    Decision problems
    0 references
    Computational complexity
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references