Formula lower bounds via the quantum method
STOC, pp. 1256-1268, 2017.
average-case complexityformula complexityformula lower boundssize amplificationbipartite formula complexityMore(2+)
A de Morgan formula over Boolean variables x1, â¦, xn is a binary tree whose internal nodes are marked with AND or OR gates and whose leaves are marked with variables or their negation. We define the size of the formula as the number of leaves in it. Proving that some explicit function (in P or NP) requires a large formula is a central o...More
Full Text (Upload PDF)
PPT (Upload PPT)