26 search results - page 1 / 6 » A Non-linear Time Lower Bound for Boolean Branching Programs |
ECCC
2008
13 years 9 months ago
2008
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
DAGSTUHL
2006
13 years 11 months ago
2006
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
TCS
2008
13 years 9 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...