Skopenkov's NP-hardness conjecture for geometric embeddability
Statement
For integers , let denote the decision problem of determining whether a given -complex has a geometric embedding in . Skopenkov's conjecture. The problem is NP-hard for all satisfying
Geometric embeddability is decidable for all because it can be expressed in the first-order theory of the reals. The conjectured NP-hardness extends the known complexity landscape for piecewise-linear embeddability, while the cited context identifies as an interesting open problem.
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.