Complex almost-injective intensity measurements have NP-complete consistency
Statement
Let be a family of ensembles which yield almost injective intensity measurements and have complex rational entries that can be computed in polynomial time. The consistency conjecture. Then is -complete. This would strengthen the preceding hardness result for the smallest possible almost-injective ensembles in the complex case, paralleling the established result for full spark ensembles with measurements; the conjectured NP-completeness is not resolved in the supplied text.
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.