d-collapsibility is NP-complete for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>d</mml:mi><mml:mo>⩾</mml:mo><mml:mn>4</mml:mn></mml:math> (Q2851437): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: String graphs. II: Recognizing string graphs is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3474685 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Representation of a finite graph by a set of intervals on the real line / 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: Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3827224 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: d-collapsing and nerves of families of convex sets / rank | |||
Normal rank | |||
Latest revision as of 23:22, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | d-collapsibility is NP-complete for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>d</mml:mi><mml:mo>⩾</mml:mo><mml:mn>4</mml:mn></mml:math> |
scientific article |
Statements
d-collapsibility is NP-complete for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>d</mml:mi><mml:mo>⩾</mml:mo><mml:mn>4</mml:mn></mml:math> (English)
0 references
10 October 2013
0 references
simplicial complex
0 references
d-collapsibility
0 references
d-representability
0 references
NP-complete
0 references
