Collapsibility to a subcomplex of a given dimension is NP-complete (Q1702356): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2604403314 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1703.06983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Morse theory for cellular resolutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Discrete Morse Theory and a New Library of Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Discrete Morse Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On discrete Morse functions and combinatorial decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computationally intractable problem on simplicial complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Morse theory for cell complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Optimal Morse Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algebraic topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of collapsible complexes is NP-complete / rank
 
Normal rank

Latest revision as of 06:34, 15 July 2024

scientific article
Language Label Description Also known as
English
Collapsibility to a subcomplex of a given dimension is NP-complete
scientific article

    Statements

    Collapsibility to a subcomplex of a given dimension is NP-complete (English)
    0 references
    0 references
    28 February 2018
    0 references
    0 references
    simplicial complexes
    0 references
    collapsibility
    0 references
    discrete Morse theory
    0 references
    NP-hardness
    0 references
    0 references
    0 references