We exhibit an unambiguous k-DNF formula that requires CNF widthOmega~(k^{1.5) Our construction is inspired by the board game Hex and it isvastly simpler than previous ones . Our result is known to imply several other improved separations in query andcommunication complexity .

Author(s) : Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari

Links : PDF - Abstract

Code :
Coursera

Keywords : hex - unambiguous - isvastly - complexity - andcommunication -

Leave a Reply

Your email address will not be published. Required fields are marked *