NP-completeness of PL realizability for 2-hypergraphs in three dimensions
Statement
A 2-hypergraph is a hypergraph whose hyperedges have size two, and PL realizability in means realizability by a piecewise-linear representation in . The PL realizability conjecture. (a) Deciding whether a 2-hypergraph is PL realizable in is NP-complete. (b) Deciding whether a 2-hypergraph is PL realizable in is decidable. The supplied text is corrupted and does not identify this passage as a conjecture or provide enough reliable context to determine its intended status.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.