A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (Q1949747): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
description / endescription / en
scientific article
scientific article; zbMATH DE number 6272544
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1283.68349 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/1998196.1998219 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the twenty-seventh annual symposium on Computational geometry / rank
 
Normal rank
Property / publication date
 
24 March 2014
Timestamp+2014-03-24T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 24 March 2014 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68U05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6272544 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58644688 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Regina / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3099751394 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015674955 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1010.6200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good are convex hull algorithms? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding All Vertices of Convex Polyhedral Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3649086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introducing Regina, The 3-Manifold Topology Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting between quadrilateral and standard solution sets in normal surface theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the normal surface solution space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing the double description method for normal surface enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal admissible faces and asymptotic bounds for the normal surface solution space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weber-Seifert dodecahedral space is non-Haken / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Arithmetic Invariants of 3-Manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Newton method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Vertex Enumeration Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. / 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: Über das Homöomorphieproblem der 3-Mannigfaltigkeiten. I / 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: Q4788844 / 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: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on Perelman's papers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic topology and classification of 3-manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum numbers of faces of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4866009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average number of steps of the simplex method of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal surfaces in topologically finite 3-manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal surface \(Q\)-theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Latest revision as of 11:17, 6 July 2024

scientific article; zbMATH DE number 6272544
Language Label Description Also known as
English
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology
scientific article; zbMATH DE number 6272544

    Statements

    A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 2013
    0 references
    24 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    normal surfaces
    0 references
    vertex enumeration
    0 references
    tree traversal
    0 references
    backtracking
    0 references
    linear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references