Resolution lower bounds for the weak fun
β
Alexander A. Razborov
π
Article
π
2003
π
Elsevier Science
π
English
β 243 KB
We show that every resolution proof of the functional version FPHP m n of the pigeonhole principle (in which one pigeon may not split between several holes) must have size exp( (n=(log m) 2 )). This implies an exp( (n 1=3 )) bound when the number of pigeons m is arbitrary.