Optimal first transmission conjecture for Boolean threshold functions
Statement
Let be the block of Boolean observations, let denote the Boolean threshold function, and suppose the probability distribution satisfies . Optimal first transmission conjecture. In order to compute , it is optimal for node to transmit first, using the Huffman code, for all and all . The conjecture proposes an optimal ordering for block computation under arbitrary interactive strategies and zero-error computation; its resolution is not given 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.