This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
40th Annual Symposium on Foundations of Computer Science
A Non-Linear Time Lower Bound for Boolean Branching Programs
New York, New York
October 17-October 18
ISBN: 0-7695-0409-4
Miklos Ajtai, IBM Almaden Research Center
We prove that for all positive integer k and for all sufficiently small \math if n is sufficiently large then there is no Boolean (or 2-way) branching program of size less than \math which for all inputs \math computes in time kn the parity of the number of elements of the set of all pairs x,y with the property \math. For the proof of this fact we show that if \mathn is a random n by n matrix over the field with 2 elements with the condition that "\math, \math implies \math" then with a high probability the rank of each \math by \math submatrix of A is at least \math, where \math is an absolute constant and n is sufficiently large with respect to \math.
Index Terms:
branching program, lower bound, Hankel matrix
Citation:
Miklos Ajtai, "A Non-Linear Time Lower Bound for Boolean Branching Programs," focs, pp.60, 40th Annual Symposium on Foundations of Computer Science, 1999
Usage of this product signifies your acceptance of the Terms of Use.