Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional languag...
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...