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

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5404419
description / endescription / en
 
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 / OpenAlex ID
 
Property / OpenAlex ID: W2015674955 / rank
 
Normal rank

Revision as of 08:31, 6 May 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
    16 May 2013
    0 references
    24 March 2014
    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

    Identifiers

    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