The explicit complexity conjecture for C_p^nq^m
Statement
Let and be distinct primes, let , and let denote the complexity. Let and denote the sizes of the simple and double rainbows, respectively. Explicit complexity conjecture.
This refines the preceding simple-and-double-rainbow conjecture using the paper’s computations of the sizes of the two rainbow constructions.
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.