The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a t...
Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. F...
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies 1, 2, . . . s.t. every K-proof of i must...
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, ...
Abstract-- We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function wh...
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...