Co-NP-completeness of finite-support Gardens of Eden and rectangular orphans
Statement
For the Game of Life, consider finite-support Gardens of Eden and rectangular orphans, with the encodings specified in the paper and polynomial-time many-one reductions. Co-NP-completeness conjecture. Finite-support Gardens of Eden and rectangular orphans are co-NP-complete. The paper establishes a polynomial-time reduction from finite-support Gardens of Eden to orphans but does not provide a converse reduction, so the claimed completeness remains open.
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.